1. Editors’ foreword

   • László Lovász
   • László Babai

   EditorialNotes Pages: i - i

2. Eigenvalues and expanders

   • Noga Alon

   OriginalPaper Pages: 83 - 96

3. Independent unbiased coin flips from a correlated biased source—A finite state markov chain

   • Manuel Blum

   OriginalPaper Pages: 97 - 108

4. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

   • Harold N. Gabow
   • Zvi Galil
   • Robert E. Tarjan

   OriginalPaper Pages: 109 - 122

5. An augmenting path algorithm for linear matroid parity

   • Harold N. Gabow
   • Matthias Stallmann

   OriginalPaper Pages: 123 - 150

6. Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes

   • Sergiu Hart
   • Micha Sharir

   OriginalPaper Pages: 151 - 177

7. The average-case analysis of some on-line algorithms for bin packing

   • Peter W. Shor

   OriginalPaper Pages: 179 - 200