Suppose a language L can be decided by a bounded-error randomized algorithm that runs in space S and time n · poly(S). We give a randomized algorithm for L that still runs in space O(S) and time n · poly(S) that uses only O(S) random bits; our algorithm has a low failure probability on all but a negligible fraction of inputs of each length. An immediate corollary is a deterministic algorithm fo...

In this paper we prove that two local conditions involving the degrees and co-degrees in a graph can be used to determine whether a given vertex partition is Frieze–Kannan-regular. With a more refined version of these two local conditions we provide a deterministic algorithm that obtains a Frieze–Kanan-regular partition of any graph G in time O(|V (G)|).

We introduce the concept of a sensitive E-approximation , and use it to derive a more efficient algorithm for computing &-nets. We define and investigate product range spaces, for which we establish sampling theorems analogous to the standard finite VC-dimensional case. This generalizes and simplifies results from previous works. We derive a simpler optimal deterministic convex hull algorithm, ...

We consider a basic problem in the general data streaming model, namely, to estimate a vector f ∈ Z that is arbitrarily updated (i.e., incremented or decremented) coordinatewise. The estimate f̂ ∈ Z must satisfy ‖f̂ − f‖∞ ≤ ǫ‖f‖1, that is, ∀i (|f̂i − fi| ≤ ǫ‖f‖1). It is known to have Õ(ǫ) randomized space upper bound [4], Ω(ǫ log(ǫn)) space lower bound [2] and deterministic space upper bound of Ω̃(...

This paper proposes a new graph proximity measure. This measure is a derivative of network reliability. By analyzing its properties and comparing it against other proximity measures through graph examples, we demonstrate that it is more consistent with human intuition than competitors. A new deterministic algorithm is developed to approximate this measure with practical complexity. Empirical ev...

We present a deterministic algorithm running in space O log n= log logn solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(logn) time-bounded algorithm for this problem running on a parallel pointer machine.

A scientific approach to Free Will is described. A model is constructed that exhibits the essential observable properties commonly called Free Will. The model is a deterministic algorithm. The key element is an algorithm that recognizes an attempt to predict responses and has a tendency to resist such challenges. We have created a computer with Free Will. The implications for the philosophical ...

Here in, an application of a new seismic inversion algorithm in one of Iran’s oilfields is described. Stochastic (geostatistical) seismic inversion, as a complementary method to deterministic inversion, is perceived as contribution combination of geostatistics and seismic inversion algorithm. This method integrates information from different data sources with different scales, as prior informat...

In this paper we devise an optimal deterministic algorithm for routing h-relations on-line on an N -input/output multibutterfly. The algorithm, which is obtained by generalizing the circuit-switching techniques of [3], routes any h-relation with messages of X bits in O h(X + logN ) steps in the bit model, and in O hdX= logNe + logN communication steps in the word model. Unlike other recently de...

This paper focuses on the application of an original global optimization algorithm, based on the hybridization between a genetic algorithm and a semi-deterministic algorithm, for the resolution of various constrained optimization problems for realistic credit portfolios. Results are analyzed from a financial point of view in order to confirm their relevance. KEYWORDCredit Portfolio Management, ...