Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarRandom 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 - Gordon Simons, Yi-Ching Yao:
Asymptotic sine laws arising from alternating random permutations and sequences. 75-95
Volume 8, Number 2, March 1996
- Andrés D. Fundia:
Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs. 131-147
Volume 8, Number 3, May 1996
- 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
Volume 8, Number 4, July 1996
- 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
maintained by 
at 
at 
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2018-05-23 06:06 CEST by the dblp team