| 345 | -- | 363 | Jop F. Sibeyn. One-by-One Cleaning for Practical Parallel List Ranking |
| 364 | -- | 395 | Amir M. Ben-Amram, Zvi Galil. Lower Bounds for Dynamic Data Structures on Algebraic RAMs |
| 396 | -- | 422 | Dimitris Fotakis, Paul G. Spirakis. Minimum Congestion Redundant Assignments to Tolerate Random Faults |
| 423 | -- | 436 | Susan Landau, Neil Immerman. Embedding Linkages on an Integer Lattice |
| 437 | -- | 458 | James Abello, Adam L. Buchsbaum, Jeffery Westbrook. A Functional Approach to External Graph Algorithms |
| 459 | -- | 466 | Edith Cohen, Haim Kaplan. Caching Documents with Variable Sizes and Fetching Costs: An LP-Based Approach |
| 467 | -- | 473 | Thomas Erlebach, Torben Hagerup. Routing Flow Through a Strongly Connected Graph |
| 474 | -- | 506 | Paola Bertolazzi, Giuseppe Di Battista, Walter Didimo. Quasi-Upward Planarity |
| 507 | -- | 520 | Klaus Jansen, Lorant Porkolab. Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks |