| 1 | -- | 3 | Philippe Flajolet, Wojciech Szpankowski. Analysis of algorithms |
| 5 | -- | 42 | Alan M. Frieze, Colin McDiarmid. Algorithmic theory of random graphs |
| 43 | -- | 67 | Stéphane Boucheron, Danièle Gardy. An urn model from learning theory |
| 69 | -- | 101 | Edward G. Coffman Jr., David S. Johnson, Peter W. Shor, Richard R. Weber. Bin packing with discrete item sizes, part II: Tight bounds on First Fit |
| 103 | -- | 124 | Michael Drmota. Systems of functional equations |
| 125 | -- | 142 | Svante Janson, Donald E. Knuth. Shellsort with three increments |
| 143 | -- | 156 | Peter Kirschenhofer, Helmut Prodinger, Conrado Martinez. Analysis of Hoare s FIND algorithm with Median-of-three partition |
| 157 | -- | 168 | Guy Louchard. Probabilistic analysis of adaptative sampling |
| 169 | -- | 186 | Hosam M. Mahmoud, Robert T. Smythe, Mireille Régnier. Analysis of Boyer-Moore-Horspool string-matching heuristic |
| 187 | -- | 204 | Colin McDiarmid, Theodore Johnson, Harold S. Stone. On finding a minimum spanning tree in a network with random weights |
| 205 | -- | 220 | Kurt Mehlhorn, Volker Priebe. On the all-pairs shortest-path algorithm of Moffat and Takaoka |
| 221 | -- | 255 | Patricio V. Poblete, Alfredo Viola, J. Ian Munro. The Diagonal Poisson Transform and its application to the analysis of a hashing scheme |
| 257 | -- | 303 | Ulrich Schmid. Static priority scheduling of aperiodic real-time tasks |