Volume 8, Number 1, January 1996
James Allen Fill
: On the distribution of binary search trees under the random permutation model.
Volume 8, Number 2, March 1996
: Scrambling permutations and entropy of hypergraphs.
Peter de Jong
: A central limit theorem with applications to random hypergraphs.
: A random bit-flipping method for seeking agreement.
Andrés D. Fundia
: Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs.
: A linear programming perspective on the Frankl - Rödl - Pippenger theorem.
: A gap between the appearances of a k-core and a (k+1)-chromatic graph.
Volume 8, Number 3, May 1996
J. van den Berg
, A. Ermakov
: A new lower bound for the critical probability of site percolation on the square lattice.
Volume 8, Number 4, July 1996
, 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.