| 1 | -- | 22 | Noga Alon, Ravi B. Boppana. The monotone circuit complexity of Boolean functions |
| 23 | -- | 34 | Anders Björner, Peter Frankl, Richard P. Stanley. The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem |
| 35 | -- | 38 | Béla Bollobás, Andrew Thomason. Threshold functions |
| 39 | -- | 48 | Andreas W. M. Dress, László Lovász. On some combinatorial properties of algebraic matroids |
| 49 | -- | 65 | András Frank, Éva Tardos. An application of simultaneous Diophantine approximation in combinatorial optimization |
| 67 | -- | 70 | Peter Frankl. On a pursuit game on Cazley graphs |
| 71 | -- | 76 | Joel Friedman, Nicholas Pippenger. Expanding graphs contain all small trees |
| 77 | -- | 85 | J. I. Hall. A local characterization of the Johnson scheme |
| 87 | -- | 99 | Eugene M. Luks. Computing the composition factors of a permutation group in polynomial time |
| 101 | -- | 104 | Ketan Mulmuley. A fast parallel algorithm to compute the rank of a matrix over an arbitrary field |
| 105 | -- | 113 | Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani. Matching is as easy as matrix inversion |
| 115 | -- | 119 | Hans Jürgen Prömel, B. L. Rothschild. A canonical restricted version of van der Waerden s theorem |
| 121 | -- | 129 | Eli Shamir, Joel Spencer. Sharp concentration of the chromatic number on random graphs G::n, p:: |
| 131 | -- | 143 | Micha Sharir. Almost linear upper bounds on the length of general Davenport-Schinzel sequences |
| 145 | -- | 150 | Carsten Thomassen. On digraphs with no two disjoint directed cycles |