| 317 | -- | 327 | Michael Mitzenmacher. Bounds on the Greedy Routing Algorithm for Array Networks |
| 328 | -- | 343 | Eric J. Schwabe, Ian M. Sutherland. Improved Parity-Declustered Layouts for Disk Arrays |
| 344 | -- | 356 | Margaret Reid-Miller. List Ranking and List Scan on the CRAY C90 |
| 357 | -- | 370 | Bhaskar Ghosh, S. Muthukrishnan. Dynamic Load Balancing by Random Matchings |
| 371 | -- | 379 | Hisao Tamaki. Construction of the Mesh and the Torus Tolerating a Large Number of Faults |
| 380 | -- | 394 | Mauro Leoncini. On the Parallel Complexity of Gaussian Elimination with Pivoting |
| 395 | -- | 416 | Shay Halperin, Uri Zwick. An Optimal Randomised Logarithmic Time Connectivity Algorithm for the EREW PRAM |
| 417 | -- | 442 | Phillip B. Gibbons, Yossi Matias, Vijaya Ramachandran. Efficient Low-Contention Parallel Algorithms |
| 443 | -- | 468 | Carlo Meghini, Costantino Thanos. An Optimal Predicate Locking Scheduler |
| 469 | -- | 486 | Andreas Goerdt. A Threshold for Unsatisfiability |
| 487 | -- | 496 | Lila Kari, Gabriel Thierrin. Maximal and Minimal Solutions to Language Equations |
| 497 | -- | 512 | Thomas Eiter, Georg Gottlob. The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions |
| 513 | -- | 524 | Tao Jiang, Ming Li. K One-Way Heads Cannot Do String-Matching |
| 525 | -- | 544 | Jean R. S. Blair, Errol L. Lloyd. River Routing with a Generalized Model |
| 545 | -- | 555 | Suresh Chari, Pankaj Rohatgi. On Completeness Under Random Reductions |
| 556 | -- | 574 | Joost Engelfriet, Vincent van Oostrom. Regular Description of Context-Free Graph Languages |
| 575 | -- | 582 | Jerzy W. Grzymala-Busse, Soe Than. Partition Triples: A Tool for Reduction of Data Sets |
| 583 | -- | 591 | Sanjay Jain. Program Synthesis in the Presence of Infinite Number of Inaccuracies |