| 427 | -- | 453 | Ketan Mulmuley. An Efficient Algorithm for Hidden Surface Removal, II |
| 454 | -- | 477 | Bonnie Berger, John Rompel, Peter W. Shor. Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry |
| 478 | -- | 516 | Rajeev Motwani, Joseph Naor, Moni Naor. The Probabilistic Method Yields Deterministic Parallel Algorithms |
| 517 | -- | 561 | Vijaya Ramachandran, John H. Reif. Planarity Testing in Parallel |
| 562 | -- | 588 | Miklós Ajtai, Yuri Gurevich. Datalog vs First-Order Logic |
| 589 | -- | 604 | Mark A. Fulk, Sanjay Jain, Daniel N. Osherson. Open Problems in Systems That Learn |
| 605 | -- | 619 | Jin-yi Cai, Juris Hartmanis. On Hausdorff and Topological Dimensions of the Kolmogorov Complexity of the Real Line |
| 620 | -- | 666 | Zhenyu Qian. Another Look at Parameterization for Order-Sorted Algebraic Specifications |
| 667 | -- | 682 | Joan Boyar, Kim S. Larsen. Efficient Rebalancing of Chromatic Search Trees |
| 683 | -- | 717 | Mark Levene, George Loizou. The Nested Universal Relation Data Model |
| 718 | -- | 725 | Bruno Durand. The Surjectivity Problem for 2D Cellular Automata |
| 726 | -- | 768 | Minoru Ito, Grant E. Weddell. Implication Problems for Functional Constraints on Databases Supporting Complex Objects |
| 769 | -- | 779 | Michael R. Fellows, Michael A. Langston. On Search, Decision, and the Efficiency of Polynomial-Time Algorithms |