| 389 | -- | 396 | Michael Tarsi. Optimal Search on Some Game Trees |
| 397 | -- | 416 | Arnold L. Rosenberg. Three-Dimensional VLSI: A Case Study |
| 417 | -- | 427 | David W. Matula, Leland L. Beck. Smallest-Last Ordering and clustering and Graph Coloring Algorithms |
| 428 | -- | 448 | Kenneth J. Supowit. The Relative Neighborhood Graph, with an Application to Minimum Spanning Trees |
| 449 | -- | 456 | Eshrat Arjomandi, Michael J. Fischer, Nancy A. Lynch. Efficiency of Synchronous Versus Asynchronous Distributed Systems |
| 457 | -- | 478 | Edward G. Coffman Jr., Ravi Sethi. Instruction Sets for Evaluating Arithmetic Expressions |
| 479 | -- | 513 | Catriel Beeri, Ronald Fagin, David Maier, Mihalis Yannakakis. On the Desirability of Acyclic Database Schemes |
| 514 | -- | 550 | Ronald Fagin. Degrees of Acyclicity for Hypergraphs and Relational Database Schemes |
| 551 | -- | 563 | Dan Gusfield. Parametric Combinatorial Computing and a Problem of Program Module Distribution |
| 564 | -- | 594 | Rajan Suri. Robustness of Queuing Network Formulas |
| 595 | -- | 611 | Jean-Claude Raoult, Ravi Sethi. Properties of a Notation for Combining Functions |
| 612 | -- | 636 | Edmund M. Clarke, Steven M. German, Joseph Y. Halpern. Effective Axiomatizations of Hoare Logics |
| 637 | -- | 640 | Georg Gati. The Complexity of Solving Polynomial Equations by Quadrature |
| 641 | -- | 656 | Oscar H. Ibarra, Brian S. Leininger. On the Simplification and Equivalence Problems for Straight-Line Programs |
| 657 | -- | 667 | Joseph JáJá. Time-Space Trade-offs for Some Algebraic Problems |
| 668 | -- | 676 | Leslie Lamport. The Weak Byzantine Generals Problem |
| 677 | -- | 685 | Xu Mei-Rui, John E. Donner, Ronald V. Book. Refining Nondeterminism in Relativizations of Complexity Classes |