| 1973 | An Observation on Time-Storage Trade Off Stephen A. Cook |
| 1973 | An Unusual Application of Program-Proving Mitchell Wand |
| 1973 | Analysis of Algorithms, a Case Study: Determinants of Polynomials W. Morven Gentleman, Stephen C. Johnson |
| 1973 | Analysis of Structured Programs S. Rao Kosaraju |
| 1973 | Approximation Algorithms for Combinatorial Problems David S. Johnson |
| 1973 | Attributed Translations Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns |
| 1973 | Classes of Semigroups and Classes of Sets Samuel Eilenberg |
| 1973 | Complete Register Allocation Problems Ravi Sethi |
| 1973 | Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues Vaughan R. Pratt |
| 1973 | Context-Free Error Analysis by Evaluation of Algebraic Power Series Ray Teitelbaum |
| 1973 | Correct and Optimal Implementations of Recursion in a Simple Programming Language Jean Vuillemin |
| 1973 | Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms John E. Hopcroft, Jean E. Musinski |
| 1973 | Elementary Bounds for Presburger Arithmetic Derek C. Oppen |
| 1973 | Fast Computation of GCDs Robert T. Moenck |
| 1973 | Fast On-Line Integer Multiplication Michael J. Fischer, Larry J. Stockmeyer |
| 1973 | From Algebras to Programming Languages Eric G. Wagner |
| 1973 | Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract Sheila A. Greibach |
| 1973 | Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient Peter Weiner, Sam L. Savage, A. Bagchi |
| 1973 | On Finding Lowest Common Ancestors in Trees Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman |
| 1973 | On the Optimal Evaluation of a Set of Bilinear Forms Roger W. Brockett, David P. Dobkin |
| 1973 | On the Time and Tape Complexity of Languages I Harry B. Hunt III |
| 1973 | Polynomial Time Reducibility Richard E. Ladner |
| 1973 | Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, USA Alfred V. Aho, Allan Borodin, Robert L. Constable, Robert W. Floyd, Michael A. Harrison, Richard M. Karp, H. Raymond Strong |
| 1973 | Sets that Don't Help Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer |
| 1973 | Testing Flow Graph Reducibility Robert Endre Tarjan |
| 1973 | The Computational Complexity of Algebraic Numbers H. T. Kung |
| 1973 | The Lane Tracing Algorithm for Constructing LR(k) Parsers David Pager |
| 1973 | Toward Mechanical Verification of Properties of Roundoff Error Propagation Webb Miller |
| 1973 | Tree Transductions and Families of Tree Languges Brenda S. Baker |
| 1973 | Type Two Computational Complexity Robert L. Constable |
| 1973 | Word Problems Requiring Exponential Time: Preliminary Report Larry J. Stockmeyer, Albert R. Meyer |