Volume 20,
Number 1,
January 2002
- Alon Amit, Nathan Linial, Jirí Matousek:
Random lifts of graphs: Independence and chromatic number.
1-22 BibTeX
- Ricardo A. Baeza-Yates, Gonzalo Navarro:
New and faster filters for multiple approximate string matching.
23-49 BibTeX
- Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz:
Inexpensive d-dimensional matchings.
50-58 BibTeX
- Jason Schweinsberg:
An O(n2) bound for the relaxation time of a Markov chain on cladograms.
59-70 BibTeX
- Alexander Gnedin, Sergei Kerov:
Fibonacci solitaire.
71-88 BibTeX
- Paul Balister:
Vertex-distinguishing edge colorings of random graphs.
89-97 BibTeX
- Martin E. Dyer, Catherine S. Greenhill, Michael Molloy:
Very rapid mixing of the Glauber dynamics for proper colorings on bounded-degree graphs.
98-114 BibTeX
- Jean-François Marckert, Alois Panholzer:
Noncrossing trees are almost conditioned Galton-Watson trees.
115-125 BibTeX
- Tom Bohman, Alan M. Frieze:
Addendum to avoiding a giant component.
126-130 BibTeX
Volume 20,
Number 2,
March 2002
- Peter Frankl, Vojtech Rödl:
Extremal problems on set systems.
131-164 BibTeX
- Michal Parnas, Dana Ron:
Testing the diameter of graphs.
165-183 BibTeX
- Michael A. Bender, Dana Ron:
Testing properties of directed graphs: acyclicity and connectivity.
184-205 BibTeX
- Tao Jiang, Ming Li, Paul M. B. Vitányi:
The average-case area of Heilbronn-type triangles.
206-219 BibTeX
- Matthias Löwe, Christian Meise:
Right order spectral gap estimates for generating sets of Z4.
220-238 BibTeX
- Aaron Abrams, Henry Landau, Zeph Landau, James Pommersheim, Eric Zaslow:
Evasive random walks and the clairvoyant demon.
239-248 BibTeX
- Dimitris Achlioptas, Jeong Han Kim, Michael Krivelevich, Prasad Tetali:
Two-coloring random hypergraphs.
249-259 BibTeX
Volume 20,
Number 3,
May 2002
Volume 20,
Number 4,
July 2002
Copyright © Sun May 17 00:18:10 2009
by Michael Ley (ley@uni-trier.de)
