| 373 | -- | 384 | Rakesh K. Sinha, Jayram S. Thathachar. Efficient Oblivious Branching Programs for Threshold and Mod Functions |
| 385 | -- | 401 | Daniel J. Kleitman, Frank Thomson Leighton, Yuan Ma. On the Design of Reliable Boolean Circuits That Contain Partially Unreliable Gates |
| 402 | -- | 413 | David R. Karger, Daphne Koller. (De)randomized Construction of Small Sample Spaces in NC |
| 414 | -- | 440 | Jeffrey C. Jackson. An Efficient Membership-Query Algorithm for Learning DNF with Respect to the Uniform Distribution |
| 441 | -- | 453 | Edith Cohen. Size-Estimation Framework with Applications to Transitive Closure and Reachability |
| 454 | -- | 476 | Karsten Weihe. Maximum (s, t)-Flows in Planar Networks in O(|V|log|V|)-Time |
| 477 | -- | 488 | Jean Berstel, Luc Boasson. The Set of Minimal Words of a Context-Free Language is Context-Free |
| 489 | -- | 503 | Joost Engelfriet, Vincent van Oostrom. Logical Description of Contex-Free Graph Languages |
| 504 | -- | 521 | Joan Boyar, Rolf Fagerberg, Kim S. Larsen. Amortization Results for Chromatic Search Trees, with an Application to Priority Queues |
| 522 | -- | 528 | Eddy Fromentin, Michel Raynal. Shared Global States in Distributed Computations |
| 529 | -- | 546 | G. Y. Yan, Andreas Alexander Albrecht, G. H. F. Young, Chak-Kuen Wong. The Steiner Tree Problem in Orientation Metrics |
| 547 | -- | 560 | Lane A. Hemaspaandra, Mitsunori Ogihara. Universally Serializable Computation |