| 1974 | On the Power of Multiplication in Random Access Machines | Juris Hartmanis, Janos Simon |
| 1974 | The Recursive Equivalence of the Reachability Problem and the Liveness Problem for Petri Nets and Vector Addition Systems | Michel Hack |
| 1974 | Initial Algebra Semantics | Joseph A. Goguen, James W. Thatcher |
| 1974 | Two Way Deterministic Pushdown Automaton Languages and Some Open Problems in the Theory of Computation | Zvi Galil |
| 1974 | Relationships between Monadic Recursion Schemes and Deterministic Context-Free Languages | Emily P. Friedman |
| 1974 | Skeletal LR Parsing | Alan J. Demers |
| 1974 | Non-Complex Sequences: Characterizations and Examples | Robert P. Daley |
| 1974 | Characterization of Context-Free Grammatical Families | Armin B. Cremers, Seymour Ginsburg |
| 1974 | Recursive Schemes, Algebraic Trees and Deterministic Languages | Bruno Courcelle |
| 1974 | A Two-Dimensional Generating System Modeling Growth by Binary Cell Division (Preliminary Report) | Jack W. Carlyle, Sheila A. Greibach, Azaria Paz |
| 1974 | "Natural" Properties of Flowchart Complexity Measures | Theodore P. Baker |
| 1974 | Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract) | Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman |
| 1973 | Optimization among Provably Equivalent Programs (Preliminary Abstract) | Paul Young |
| 1973 | Linear Pattern Matching Algorithms | Peter Weiner |
| 1973 | Non-Canonical Parsing | Thomas G. Szymanski, John H. Williams |
| 1973 | On Tape-Bounded Complexity Classes and Multi-Head Finite Automata | Ivan Hal Sudborough |
| 1973 | On Finding and Updating Shortest Paths and Spanning Trees | Philip M. Spira, A. Pan |
| 1973 | Refinements of the Nondeterministic Time and Space Hierarchies | Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer |
| 1973 | Statistical Indicators of Optimality | Sam L. Savage |
| 1973 | Complexity of Recognition in Intermediate-Level Languages | William C. Rounds |
| 1973 | On Lower Bounds for Computing the i-th Largest Element | Vaughan R. Pratt, Foong Frances Yao |
| 1973 | On the Ability to Cover LR(k) Grammars with LR(1), SLR(1), and (1,1) Bounded-Context Grammars | M. Dennis Mickunas, Victor B. Schneider |
| 1973 | On the Size of Sets of Computable Functions | Kurt Mehlhorn |
| 1973 | A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes | Michael Machtey |
| 1973 | Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) | Tiko Kameda, Shunichi Toida |