default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRandom 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
Volume 8, Number 2, March 1996
- 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
Volume 8, Number 3, May 1996
- 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 F. Sidorenko:
Randomness friendly graphs. 229-241
Volume 8, Number 4, July 1996
- Harry Kesten, Boris G. 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
