Sciweavers

RSA
2002
61views more  RSA 2002»
13 years 11 months ago
The diameter of a long-range percolation graph
Don Coppersmith, David Gamarnik, Maxim Sviridenko
RSA
2002
75views more  RSA 2002»
13 years 11 months ago
On the expected value of the minimum assignment
: We prove the main conjecture of the paper "On the expected value of the minimum assignment" by Marshall W. Buck, Clara S. Chan, and David P. Robbins [Random Structures ...
Marshall W. Buck, Clara S. Chan, David P. Robbins
RSA
2002
81views more  RSA 2002»
13 years 11 months ago
Decycling numbers of random regular graphs
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
Sheng Bau, Nicholas C. Wormald, Sanming Zhou
RSA
2002
73views more  RSA 2002»
13 years 11 months ago
New and faster filters for multiple approximate string matching
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
Ricardo A. Baeza-Yates, Gonzalo Navarro
RSA
2002
43views more  RSA 2002»
13 years 11 months ago
On the discrepancy of combinatorial rectangles
Let Bd n denote the family which consists of all subsets S1
Noga Alon, Benjamin Doerr, Tomasz Luczak, Tomasz S...
RSA
2002
51views more  RSA 2002»
13 years 11 months ago
Testing subgraphs in large graphs
Let H be a fixed graph with h vertices, let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. It is known that in this ca...
Noga Alon