Combinatorics, Probability & Computing, Volume 8, 1999

Volume 8, Number 4, 1999

• Sven Erick Alm, John C. Wierman: Inequalities For Means Of Restricted First-Passage Times In Percolation Theory.
• Robert P. Dobrow, James Allen Fill: Total Path Length For Random Recursive Trees.
• Angelika Steger, Nicholas C. Wormald: Generating Random Regular Graphs Quickly.
• Vojtech Rödl, Andrzej Rucinski, Anusch Taraz: Hypergraph Packing And Graph Embedding.
• Peter Eichelsbacher, Malgorzata Roos: Compound Poisson Approximation For Dissociated Random Variables Via Stein's Method.
• Svante Janson: One, Two And Three Times Log N/N For Paths In A Complete Graph With Random Weights.
• Rudolf Ahlswede, Ning Cai: A Counterexample To Kleitman's Conjecture Concerning An Edge-Isoperimetric Problem.

Volume 8, Number 5, 1999

• Isa Cakir, Ourania Chryssaphinou, Marianne Månsson: On A Conjecture By Eriksson Concerning Overlap In Strings.
• Richard Arratia, Andrew D. Barbour, Simon Tavaré: The Poisson-Dirichlet Distribution And The Scale-Invariant Poisson Process.
• Yahya Ould Hamidoune, Anna S. Lladó, Oriol Serra: On Sets With A Small Subset Sum.
• Michael Mitzenmacher: Studying Balanced Allocations With Differential Equations.
• Stephen Guattery, Frank Thomson Leighton, Gary L. Miller: The Path Resistance Method For Bounding The Smallest Nontrivial Eigenvalue Of A Laplacian.
• Riste Skrekovski: A Grötzsch-Type Theorem For List Colourings With Impropriety One.
• Oleg Pikhurko: The Minimum Size Of Saturated Hypergraphs.
• Helmut Alt, Ulrich Fuchs, Klaus Kriegel: On The Number Of Simple Cycles In Planar Graphs.
• Alexandr V. Kostochka, Jaroslav Nesetril: Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number.
• Claudia Bertram-Kretzberg, Thomas Hofmeister, Hanno Lefmann: Sparse 0-1-Matrices And Forbidden Hypergraphs.

Volume 8, Number 6, 1999

• Jochen Harant, Anja Pruchnewski, Margit Voigt: On Dominating Sets And Independent Sets Of Graphs.
• Petros Hadjicostas: The Asymptotic Proportion Of Subdivisions Of A 2 × 2 Table That Result In Simpson's Paradox.
• Dudley Stark: Total Variation Asymptotics For Refined Poisson Process Approximations Of Random Logarithmic Assemblies.
• Éva Czabarka: Intersecting Chains In Finite Vector Spaces.
• Tristan Denley, Talmage James Reid: On The Number Of Elements In Matroids With Small Circuits Or Cocircuits.
• Alan Stacey: Searches On A Binary Tree With Random Edge-Weights.