| 203 | -- | 204 | Alexander A. Shvartsman. In Memoriam: Paris C. Kanellakis (1953-1995) |
| 205 | -- | 217 | Béla Bollobás, Trevor I. Fenner, Alan M. Frieze. On the Best Case of Heapsort |
| 218 | -- | 243 | Alon Itai, Hadas Shachnai. Adaptive Source Routing in High-Speed Networks |
| 244 | -- | 267 | Shreesh Jadhav, Asish Mukhopadhyay, Binay K. Bhattacharya. An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons |
| 268 | -- | 281 | Charles J. Colbourn, Wendy J. Myrvold, Eugene Neufeld. Two Algorithms for Unranking Arborescences |
| 282 | -- | 311 | Pallab Dasgupta, P. P. Chakrabarti, S. C. De Sarkar. Multiobjektive Heuristic Search in AND/OR Graphs |
| 312 | -- | 355 | Alan M. Frieze, Stephen Suen. Analysis of Two Simple Heuristics on a Random Instance of k-SAT |
| 356 | -- | 374 | Alessandro Panconesi, Aravind Srinivasan. On the Complexity of Distributed Network Decomposition |
| 375 | -- | 399 | Volker Heun, Ernst W. Mayr. A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube |
| 400 | -- | 430 | David R. Karger, Steven J. Phillips, Eric Torng. A Better Algorithm for an Ancient Scheduling Problem |
| 431 | -- | 442 | Donald E. Knuth. An Exact Analysis of Stable Allocation |