RSA
2000
13 years 11 months ago
2000
We show the existence of various versions of expander graphs using Kolmogorov complexity. This method seems superior to the usual probabilistic construction. It turns out that the...
RSA
2000
13 years 11 months ago
2000
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
RSA
2000
13 years 11 months ago
2000
RSA
2000
13 years 11 months ago
2000
RSA
2000
13 years 11 months ago
2000
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
RSA
2000
13 years 11 months ago
2000
RSA
2000
13 years 11 months ago
2000
Let M = (mij) be a random n
RSA
2000
13 years 11 months ago
2000
A succinct series expression is derived for describing the limit distribution of the number of times r consecutive elements are all records (in a sequence of independent and ident...
RSA
2000
13 years 11 months ago
2000
The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...