| 1974 | Some Restrictions on W-Grammars | Sheila A. Greibach |
| 1974 | Computational Complexity of Probabilistic Turing Machines | John T. Gill III |
| 1974 | Some Simplified NP-Complete Problems | M. R. Garey, David S. Johnson, Larry J. Stockmeyer |
| 1974 | Complexity Measures for Regular Expressions | Andrzej Ehrenfeucht, H. Paul Zeiger |
| 1974 | On Some Generalizations of Binary Search | David P. Dobkin, Richard J. Lipton |
| 1974 | Semantics and Axiomatics of a Simple Recursive Language | Bruno Courcelle, Jean Vuillemin |
| 1974 | Storage Requirements for Deterministic Polynomial Time Recognizable Languages | Stephen A. Cook, Ravi Sethi |
| 1974 | On the Lengths of Proofs in the Propositional Calculus (Preliminary Version) | Stephen A. Cook, Robert A. Reckhow |
| 1974 | Degrees of Translatability and Canonical Forms in Program Schemas: Part I | Ashok K. Chandra |
| 1974 | On the Number of Additions to Compute Specific Polynomials (Preliminary Version) | Allan Borodin, Stephen A. Cook |
| 1974 | Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract) | Ronald V. Book, Maurice Nivat, Mike Paterson |
| 1973 | Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient | Peter Weiner, Sam L. Savage, A. Bagchi |
| 1973 | An Unusual Application of Program-Proving | Mitchell Wand |
| 1973 | From Algebras to Programming Languages | Eric G. Wagner |
| 1973 | Correct and Optimal Implementations of Recursion in a Simple Programming Language | Jean Vuillemin |
| 1973 | Context-Free Error Analysis by Evaluation of Algebraic Power Series | Ray Teitelbaum |
| 1973 | Testing Flow Graph Reducibility | Robert Endre Tarjan |
| 1973 | Word Problems Requiring Exponential Time: Preliminary Report | Larry J. Stockmeyer, Albert R. Meyer |
| 1973 | Complete Register Allocation Problems | Ravi Sethi |
| 1973 | Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues | Vaughan R. Pratt |
| 1973 | The Lane Tracing Algorithm for Constructing LR(k) Parsers | David Pager |
| 1973 | Elementary Bounds for Presburger Arithmetic | Derek C. Oppen |
| 1973 | Fast Computation of GCDs | Robert T. Moenck |
| 1973 | Toward Mechanical Verification of Properties of Roundoff Error Propagation | Webb Miller |
| 1973 | Sets that Don't Help | Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer |