| 505 | -- | 536 | Rina Dechter, Judea Pearl. Generalized Best-First Search Strategies and the Optimality of A* |
| 537 | -- | 548 | Edward A. Bender, Jon T. Butler. Enumeration of Structured Flowcharts |
| 549 | -- | 561 | William H. Cunningham. Optimal Attach and Reinforcement of a Network |
| 562 | -- | 572 | C. C. Lee, D. T. Lee. A Simple On-Line Bin-Packing Algorithm |
| 573 | -- | 588 | Bernard Chazelle, Louis Monier. A Model of Computation for VLSI with Related Complexity Results |
| 589 | -- | 596 | Albert G. Greenberg, Shmuel Winograd. A Lower Bound on the Time Needed in the Worst Case to Resolve Conflicts Deterministically in Multiple Access Channels |
| 597 | -- | 617 | Dan E. Willard, George S. Lueker. Adding Range Restriction Capability to Dynamic Data Structures |
| 618 | -- | 651 | Y. C. Tay, Rajan Suri, Nathan Goodman. A Mean Value Performance Model for Locking in Databases: The No-Waiting Case |
| 652 | -- | 686 | Daniel Dominic Sleator, Robert Endre Tarjan. Self-Adjusting Binary Search Trees |
| 687 | -- | 693 | Andrew Chi-Chih Yao. Uniform Hashing Is Optimal |
| 694 | -- | 701 | David Zerling. Generating Binary Trees Using Rotations |
| 702 | -- | 719 | Wei-Lu Cao, William J. Stewart. Iterative Aggregation/Disaggregation Techniques for Nearly Uncoupled Markov Chains |
| 720 | -- | 732 | Udi Manber, Martin Tompa. The Complexity of Problems on Probabilistic Nondeterministic, and Alternating Decision Trees |
| 733 | -- | 749 | A. Prasad Sistla, Edmund M. Clarke. The Complexity of Propositional Linear Temporal Logics |
| 750 | -- | 0 | Christos H. Papadimitriou. Correction to A Theorem in Database Concurrency Control |