Random Structures and Algorithms, Volume 25

Volume 25, Number 1, August 2004

Vojtech Rödl, Jozef Skokan:
Regularity Lemma for k-uniform hypergraphs. 1-42
Electronic Edition (link) BibTeX
Michael A. Bender, Saurabh Sethia, Steven Skiena:
Data structures for maintaining set partitions. 43-67
Electronic Edition (link) BibTeX
Mohammad R. Salavatipour:
A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma. 68-90
Electronic Edition (link) BibTeX
David A. Levin, Yuval Peres:
Identifying several biased coins encountered by a hidden random walk. 91-114
Electronic Edition (link) BibTeX
Andrew D. Barbour, Gesine Reinert:
Correction: Small worlds. 115
Electronic Edition (link) BibTeX

Johan Håstad, Srinivasan Venkatesh:
On the advantage over a random assignment. 117-149
Electronic Edition (link) BibTeX
Lars Engebretsen, Venkatesan Guruswami:
Is constraint satisfaction over two variables always easy? 150-178
Electronic Edition (link) BibTeX
Alois Panholzer:
The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. 179-207
Electronic Edition (link) BibTeX
Servet Martínez:
Some bounds on the coupon collector problem. 208-226
Electronic Edition (link) BibTeX
Michael M. Erlihson, Boris L. Granovsky:
Reversible coagulation-fragmentation processes and random combinatorial structures: Asymptotics for the number of groups. 227-245
Electronic Edition (link) BibTeX

Charles Knessl, Wojciech Szpankowski:
On the number of full levels in tries. 247-276
Electronic Edition (link) BibTeX
Jean Bertoin:
Random covering of an interval and a variation of Kingman's coalescent. 277-292
Electronic Edition (link) BibTeX
Christian Mazza:
Simply generated trees, B-series and Wigner processes. 293-310
Electronic Edition (link) BibTeX
Jochen Geiger, Lars Kauffmann:
The shape of large Galton-Watson trees with possibly infinite variance. 311-335
Electronic Edition (link) BibTeX
Timothy Prescott, Francis Edward Su:
Random walks on the torus with several generators. 336-345
Electronic Edition (link) BibTeX
Martin E. Dyer, Catherine S. Greenhill:
Corrigendum: The complexity of counting graph homomorphisms. 346-352
Electronic Edition (link) BibTeX

Colin Cooper:
The cores of random hypergraphs with a given degree sequence. 353-375
Electronic Edition (link) BibTeX
Vivek S. Borkar, Vladimir Ejov, Jerzy A. Filar:
Directed graphs, Hamiltonicity and doubly stochastic matrices. 376-395
Electronic Edition (link) BibTeX
Sándor Csörgo, Wei Biao Wu:
On the clustering of independent uniform random variables. 396-420
Electronic Edition (link) BibTeX
Fan R. K. Chung, Joshua N. Cooper:
De Bruijn cycles for covering codes. 421-431
Electronic Edition (link) BibTeX
Tom Bohman, Alan M. Frieze, Nicholas C. Wormald:
Avoidance of a giant component in half the edge set of a random graph. 432-449
Electronic Edition (link) BibTeX