1. On Lovász’ lattice reduction and the nearest lattice point problem

   • L. Babai

   OriginalPaper Pages: 1 - 13

2. The asymptotic number of acyclic digraphs. I

   • E. A. Bender
   • L. B. Richmond
   • N. C. Wormald

   OriginalPaper Pages: 15 - 22

3. A parity digraph has a kernel

   • Mostafa Blidia

   OriginalPaper Pages: 23 - 27

4. A size-width inequality for distributive lattices

   • U. Faigle
   • B. Sands

   OriginalPaper Pages: 29 - 33

5. Constructing a perfect matching is in random NC

   • R. M. Karp
   • E. Upfal
   • A. Wigderson

   OriginalPaper Pages: 35 - 48

6. Legal coloring of graphs

   • N. Linial

   OriginalPaper Pages: 49 - 54

7. Balancing vectors in the max norm

   • J. Spencer

   OriginalPaper Pages: 55 - 65

8. The solution of graham’s greatest common divisor problem

   • M. Szegedy

   OriginalPaper Pages: 67 - 71

9. On the number of paths and cycles for almost all graphs and digraphs

   • I. Tomescu

   OriginalPaper Pages: 73 - 79