82
Voted
RSA
2006
14 years 10 months ago
2006
We continue the investigation of locally testable codes, i.e., error-correcting codes for whom membership of a given word in the code can be tested probabilistically by examining ...
RSA
2006
14 years 10 months ago
2006
We study three families of labelled plane trees. In all these trees, the root is
RSA
2006
14 years 10 months ago
2006
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
RSA
2006
14 years 10 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
RSA
2006
14 years 10 months ago
2006
: Consider ordinary bond percolation on a finite or countably infinite graph. Let s, t, a, and b be vertices. An earlier paper (J. Van den Berg and J. Kahn, Ann Probab 29 (2001), 1...