| 275 | -- | 300 | Rina S. Cohen, Arie Y. Gold. Omega-Computations on Deterministic Pushdown Machines |
| 301 | -- | 322 | Arne T. Jonassen, Donald E. Knuth. A Trivial Algorithm Whose Analysis Isn t |
| 323 | -- | 332 | Derek C. Oppen. A 2^2^2^pn Upper Bound on the Complexity of Presburger Arithmetic |
| 333 | -- | 344 | Francis Y. L. Chin, David Houck. Algorithms for Updating Minimal Spanning Trees |
| 345 | -- | 361 | Hermann A. Maurer, Arto Salomaa, Derick Wood. ETOL Forms |
| 362 | -- | 399 | Calvin C. Elgot, Stephen L. Bloom, Ralph Tindell. On the Algebraic Atructure of Rooted Trees |
| 400 | -- | 412 | P. F. Schuler. Inductive Definability in Formal Language Theory |
| 413 | -- | 417 | David P. Dobkin, Richard J. Lipton. A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem |
| 418 | -- | 422 | Juris Hartmanis, Leonard Berman. On Polynomial Time Isomorphisms of Some New Complete Sets |
| 423 | -- | 444 | Paul M. B. Vitányi, Walter J. Savitch. On Inverse Deterministic Pushdown Transductions |
| 445 | -- | 455 | Andrew G. Barto. A Note on Pattern Reproduction in Tessellation Structures |
| 456 | -- | 461 | Detlef Wotschke. Nondeterminism and Boolean Operations in PDAs |