1. The monotone circuit complexity of boolean functions

   • Noga Alon
   • Ravi B. Boppana

   OriginalPaper Pages: 1 - 22

2. The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem

   • Anders Björner
   • Richard Stanley
   • Peter Frankl

   OriginalPaper Pages: 23 - 34

3. Threshold functions

   • B. Bollobás
   • A. G. Thomason

   OriginalPaper Pages: 35 - 38

4. On some combinatorial properties of algebraic matroids

   • A. Dress
   • L. Lovász

   OriginalPaper Pages: 39 - 48

5. An application of simultaneous diophantine approximation in combinatorial optimization

   • András Frank
   • Éva Tardos

   OriginalPaper Pages: 49 - 65

6. On a pursuit game on cayley graphs

   • Peter Frankl

   OriginalPaper Pages: 67 - 70

7. Expanding graphs contain all small trees

   • Joel Friedman
   • Nicholas Pippenger

   OriginalPaper Pages: 71 - 76

8. A local characterization of the johnson scheme

   • J. I. Hall

   OriginalPaper Pages: 77 - 85

9. Computing the composition factors of a permutation group in polynomial time

   • Eugene M. Luks

   OriginalPaper Pages: 87 - 99

10. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field

    • Ketan Mulmuley

    OriginalPaper Pages: 101 - 104

11. Matching is as easy as matrix inversion

    • Ketan Mulmuley
    • Umesh V. Vazirani
    • Vijay V. Vazirani

    OriginalPaper Pages: 105 - 113

12. A canonical restricted version of van der waerden’s theorem

    • H. -J. Prömel
    • B. L. Rothschild

    OriginalPaper Pages: 115 - 119

13. Sharp concentration of the chromatic number on random graphsG _{n, p}

    • Eli Shamir
    • Joel Spencer

    OriginalPaper Pages: 121 - 129

14. Almost linear upper bounds on the length of general davenport—schinzel sequences

    • Micha Sharir

    OriginalPaper Pages: 131 - 143

15. On digraphs with no two disjoint directed cycles

    • C. Thomassen

    OriginalPaper Pages: 145 - 150