| 1 | -- | 14 | Laurent Alonso, Philippe Chassaing, René Schott. The average complexity of a coin-weighing problem |
| 15 | -- | 47 | József Beck. Foundations of positional games |
| 49 | -- | 53 | Neil J. Calkin. Dependent sets of constant weight vectors in GF(q) |
| 55 | -- | 77 | Fan R. K. Chung, Ronald L. Graham, S.-T. Yau. On sampling with Markov chains |
| 79 | -- | 92 | Robert P. Dobrow, Robert T. Smythe. Poisson approximations for functionals of random trees |
| 93 | -- | 97 | Wenceslas Fernandez de la Vega. The largest induced tree in a sparse random graph |
| 99 | -- | 111 | Anna Gál, Avi Wigderson. Boolean complexity classes vs. their arithmetic analogs |
| 113 | -- | 136 | Hans Garmo. Random railways modeled as random 3-regular graphs |
| 137 | -- | 161 | Erhard Godehardt, Jerzy Jaworski. On the connectivity of a random interval graph |
| 163 | -- | 175 | Thomas Hofmeister, Hanno Lefmann. A combinatorial design approach to MAXCUT |
| 177 | -- | 192 | Alexander K. Kelmans. On graphs with the maximum number of spanning trees |
| 193 | -- | 211 | János Komlós, Gábor N. Sárközy, Endre Szemerédi. On the square of a Hamiltonian cycle in dense graphs |
| 213 | -- | 221 | Alexandr V. Kostochka. An intersection theorem for systems of sets |
| 223 | -- | 252 | James Gary Propp, David Bruce Wilson. Exact sampling with coupled Markov chains and applications to statistical mechanics |
| 253 | -- | 269 | Nicholas C. Wormald. The perturbation method and triangle-free random graphs |