| 1972 | A Bound on the Multiplication Efficiency of Iteration H. T. Kung |
| 1972 | A Hierarchy for Nondeterministic Time Complexity Stephen A. Cook |
| 1972 | A Patent Problem for Abstract Programming Languages: Machine-Independent Computations Richard G. Hamlet |
| 1972 | A Technique for Speeding Up LR(k) Parsers Alfred V. Aho, Jeffrey D. Ullman |
| 1972 | Algorithms for Rational Function Arithmetic Operations Ellis Horowitz |
| 1972 | Binary Search Trees of Bounded Balance Jürg Nievergelt, Edward M. Reingold |
| 1972 | Characterization of Flowchartable Recursions (Short Version) S. A. Walker, H. Raymond Strong |
| 1972 | Compositions of n Tree Transducers William F. Ogden, William C. Rounds |
| 1972 | Developmental Systems and Languages Aristid Lindenmayer, Grzegorz Rozenberg |
| 1972 | Flow Graph Reducibility Matthew S. Hecht, Jeffrey D. Ullman |
| 1972 | Flowchart Schemata with Counters David A. Plaisted |
| 1972 | Linear Time Bounds for Median Computations Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan |
| 1972 | Maze Recognizing Automata (Extended Abstract) Walter J. Savitch |
| 1972 | On the Additions Necessary to Compute Certain Functions David G. Kirkpatrick |
| 1972 | On the Equivalence of Schemes Stephen J. Garland, David C. Luckham |
| 1972 | Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited Charles M. Fiduccia |
| 1972 | Predecessor Machines and Regressing Functions John C. Warkentin, Patrick C. Fischer |
| 1972 | Proceedings of the 4th Annual ACM Symposium on Theory of Computing, May 1-3, 1972, Denver, Colorado, USA Patrick C. Fischer, H. Paul Zeiger, Jeffrey D. Ullman, Arnold L. Rosenberg |
| 1972 | Program Schemas with Equality Ashok K. Chandra, Zohar Manna |
| 1972 | Program Size and Economy of Descriptions: Preliminary Report Albert R. Meyer, A. Bagchi |
| 1972 | Rapid Identification of Repeated Patterns in Strings, Trees and Arrays Richard M. Karp, Raymond E. Miller, Arnold L. Rosenberg |
| 1972 | Recursion Schemes with Lists James H. Morris Jr. |
| 1972 | Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems Robert L. Constable, Steven S. Muchnick |
| 1972 | The Computation of Finite Functions D. M. Symes |
| 1972 | The Process Complexity and Effective Random Tests Claus-Peter Schnorr |
| 1972 | Time-Bounded Random Access Machines Stephen A. Cook, Robert A. Reckhow |
| 1972 | Turing Machines and the Spectra of First-Order Formulas with Equality Neil D. Jones, Alan L. Selman |
| 1972 | Uniformly Erasable AFL Sheila Carlyle-Greibach, Seymour Ginsburg, Jonathan Goldstine |
| 1972 | Validating Register Allocations for Straight Line Programs Ravi Sethi |
| 1972 | Worst-Case Analysis of Memory Allocation Algorithms M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman |