| 423 | -- | 434 | Mark E. Stickel. A Unification Algorithm for Associative-Commutative Functions |
| 435 | -- | 453 | Yehoshua Sagiv, Claude Delobel, Douglas Stott Parker Jr., Ronald Fagin. An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic |
| 454 | -- | 461 | David P. Dobkin, J. Ian Munro. Optimal Time Minimal Space Selection Algorithms |
| 462 | -- | 476 | Francis Y. L. Chin, Long-Lieh Tsai. On J-maximal and J-minimal Flow-Shop Schedules |
| 477 | -- | 486 | Leonard Kleinrock, Arne A. Nilsson. On Optimal Scheduling Algorithms for Time-Shared Systems |
| 487 | -- | 501 | Hanan Samet. Connected Component Labeling Using Quadtrees |
| 502 | -- | 520 | Sarangan Krishna Kumar, Melvin A. Breuer. Probabilistic Aspects of Boolean Switching Functions via a New Transform |
| 521 | -- | 534 | Richard P. Brent, H. T. Kung. The Area-Time Complexity of Binary Multiplication |
| 535 | -- | 560 | Eitan M. Gurari, Oscar H. Ibarra. The Complexity of the Equivalence Problem for Simple Programs |
| 561 | -- | 576 | Ernst W. Mayr, Albert R. Meyer. The Complexity of the Finite Containment Problem for Petri Nets |
| 577 | -- | 593 | Robert Endre Tarjan. A Unified Approach to Path Problems |
| 594 | -- | 614 | Robert Endre Tarjan. Fast Algorithms for Solving Path Problems |
| 615 | -- | 628 | Andrew Chi-Chih Yao. Should Tables Be Sorted? |
| 629 | -- | 0 | Martin Reiser, Stephen S. Lavenberg. Corrigendum: Mean-Value Analysis of Closed Multichain Queuing Networks |