Random Structures and Algorithms, Volume 8

Volume 8, Number 1, January 1996

James Allen Fill:
On the distribution of binary search trees under the random permutation model. 1-25
Anand Srivastav, Peter Stangier:
Algorithmic Chernoff-Hoeffding inequalities in integer programming. 27-58
C. Douglas Howard:
Detecting defects in periodic scenery by random walks on Z. 59-74
Gordon Simons, Yi-Ching Yao:
Asymptotic sine laws arising from alternating random permutations and sequences. 75-95

Zoltán Füredi:
Scrambling permutations and entropy of hypergraphs. 97-104
Peter de Jong:
A central limit theorem with applications to random hypergraphs. 105-120
Colin McDiarmid:
A random bit-flipping method for seeking agreement. 121-130
Andrés D. Fundia:
Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs. 131-147
Jeff Kahn:
A linear programming perspective on the Frankl - Rödl - Pippenger theorem. 149-157
Michael Molloy:
A gap between the appearances of a k-core and a (k+1)-chromatic graph. 159-160

Vojtech Rödl, Lubos Thoma:
Asymptotic packing and the random greedy algorithm. 161-177
James Allen Fill, Lars Holst:
On the distribution of search cost for the move-to-front rule. 179-186
Wenceslas Fernandez de la Vega:
MAX-CUT has a randomized approximation scheme in dense graphs. 187-198
J. van den Berg, A. Ermakov:
A new lower bound for the critical probability of site percolation on the square lattice. 199-212
Malgorzata Roos:
An extension of Janson's inequality. 213-227
Alexander Sidorenko:
Randomness friendly graphs. 229-241

Harry Kesten, Boris Pittel:
A local limit theorem for the number of nodes, the height, and the number of final leaves in a critical branching process tree. 243-299
Martin Hildebrand:
Random walks on random simple graphs. 301-318
Hsien-Kuei Hwang:
Limit theorems for mergesort. 319-336

Last update Sat May 18 20:51:41 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page