| 385 | -- | 395 | J. McAfee, Leon Presser. An Algorithm for the Design of Simple Precedence Grammars |
| 396 | -- | 399 | Clarence A. Ellis. The Halting Problem for Probabilistic Context-Free Generators |
| 400 | -- | 410 | Shimon Even, Amir Pnueli, Abraham Lempel. Permutation Graphs and Transitive Graphs |
| 411 | -- | 422 | John L. Pfaltz. Graph Structures |
| 423 | -- | 424 | Jin Y. Yen. Finding the Lengths of All Shortest paths in N-Node Nonnegative-Distance Complete Networks Using ½N³ Additions and N³ Comparisons |
| 425 | -- | 436 | Larry E. Stanfel. Practical Aspects of Doubly Chained Trees for Retrieval |
| 437 | -- | 444 | Nancy M. Huang, Randall E. Cline. Inversion of Persymmetric Matrices Having Toeplitz Inverses |
| 445 | -- | 452 | Isi Mitrani. Nonpriority Multiprogramming Systems Under Heavy Demand Conditions--Customers Viewpoint |
| 453 | -- | 463 | Richard E. Nance, U. Narayan Bhat, Billy G. Claybrook. Busy Period Analysis of a Time-Sharing System: transform inversion |
| 464 | -- | 482 | Leonard Kleinrock, Richard R. Muntz. Processor Sharing Queueing Models of Mixed Scheduling Disciplines for Time Shared System |
| 483 | -- | 495 | Gary D. Schultz. A Stochastic Model for Message Assembly Buffering with a Comparison of Block Assignment Strategies |
| 496 | -- | 516 | James R. Slagle. An Approach for Finding C-Linear Complete Inference Systems |
| 517 | -- | 525 | John L. Bruno, Kenneth Steiglitz. The Expression of Algorithms by Charts |
| 526 | -- | 568 | Robert L. Constable, Allan Borodin. Subrecursive Programming Languages, Part I: efficiency and program structure |
| 569 | -- | 575 | Jeffrey D. Ullman. A Note on the Efficiency of Hashing Functions |
| 576 | -- | 0 | Allan Borodin. Corrigendum: Computational Complexity and the Existence of Complexity Gaps |