| 1 | -- | 12 | Vojtech Rödl, Robin Thomas. On the Genus of a Random Graph |
| 13 | -- | 20 | Noga Alon, Benny Sudakov. Disjoint Systems |
| 21 | -- | 38 | Hans Jürgen Prömel, Angelika Steger. Random I-Cororable Graphs |
| 39 | -- | 50 | Joseph Naor, Ron M. Roth. Constructions of Permutation Arrays for Certain Scheduling Cost Measures |
| 51 | -- | 54 | Uriel Feige. A Tight Upper Bound on the Cover Time for Random Walks on Graphs |
| 55 | -- | 74 | Jonathan Aronson, Martin E. Dyer, Alan M. Frieze, Stephen Suen. Randomized Greedy Matching II |
| 75 | -- | 88 | Miklos Santha. On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae |
| 89 | -- | 104 | E. Rodney Canfield, L. H. Harper. Large Antichains in the Partition Lattice |
| 105 | -- | 112 | John Preater. A Passage Time for Greedy-Coloring Cycles |
| 113 | -- | 120 | Ron Blei, Yuval Peres, James H. Schmerl. Fractional Products of Sets |