Volume 8, Number 1, January 1996
Volume 8, Number 2, March 1996
- Zoltán Füredi:
Scrambling permutations and entropy of hypergraphs.
- Peter de Jong:
A central limit theorem with applications to random hypergraphs.
- Colin McDiarmid:
A random bit-flipping method for seeking agreement.
- Andrés D. Fundia:
Derandomizing Chebyshev's inequality to find independent sets in uncrowded hypergraphs.
- Jeff Kahn:
A linear programming perspective on the Frankl - Rödl - Pippenger theorem.
- Michael Molloy:
A gap between the appearances of a k-core and a (k+1)-chromatic graph.
Volume 8, Number 3, May 1996
Volume 8, Number 4, July 1996
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