| 1977 | A Comparison of Instruction Sets for Stack Machines Bhaskaram Prabhala, Ravi Sethi |
| 1977 | A Complete Axiomatic System for Proving Deductions about Recursive Programs David Harel, Amir Pnueli, Jonathan Stavi |
| 1977 | A New Representation for Linear Lists Leonidas J. Guibas, Edward M. McCreight, Michael F. Plass, Janet R. Roberts |
| 1977 | An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest |
| 1977 | Complexity of Finitely Presented Algebras Dexter Kozen |
| 1977 | Computability and Completeness in Logics of Programs (Preliminary Report) David Harel, Albert R. Meyer, Vaughan R. Pratt |
| 1977 | Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract) Chandra M. R. Kintala, Patrick C. Fischer |
| 1977 | Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract) Gary L. Peterson, Michael J. Fischer |
| 1977 | Efficient Reducibility Between Programming Systems: Preliminary Report Nancy A. Lynch, Edward K. Blum |
| 1977 | Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings Dana Angluin, Leslie G. Valiant |
| 1977 | Finding a Minimum Circuit in a Graph Alon Itai |
| 1977 | Graph Isomorphism, General Remarks Gary L. Miller |
| 1977 | Iteration Theorems for LL(k) Languages John C. Beatty |
| 1977 | New Real-Time Simulations of Multihead Tape Units Benton L. Leong, Joel I. Seiferas |
| 1977 | Nonserial Dynamic Programming Is Optimal Arnie Rosenthal |
| 1977 | On Feasible Numbers (Preliminary Version) Janos Simon |
| 1977 | On Time Hierarchies Wolfgang J. Paul |
| 1977 | On the Theory of Programming Logics Robert L. Constable |
| 1977 | Optimal Implementation of Conjunctive Queries in Relational Data Bases Ashok K. Chandra, Philip M. Merlin |
| 1977 | Parameter-Passing Mechanisms and Nondeterminism Matthew Hennessy, Edward A. Ashcroft |
| 1977 | Polynomial Reducibilities and Upward Diagonalizations István Simon, John Gill |
| 1977 | Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4-6, 1977, Boulder, Colorado, USA John E. Hopcroft, Emily P. Friedman, Michael A. Harrison |
| 1977 | Propositional Modal Logic of Programs (Extended Abstract) Michael J. Fischer, Richard E. Ladner |
| 1977 | Reducibility, Randomness, and Intractability (Abstract) Leonard M. Adleman, Kenneth L. Manders |
| 1977 | Reference Machines Require Non-linear Time to Maintain Disjoint Sets Robert Endre Tarjan |
| 1977 | Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version) Juris Hartmanis |
| 1977 | Separating Tape Bounded Auxiliary Pushdown Automata Classes Ivan Hal Sudborough |
| 1977 | Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic Mike O'Donnell |
| 1977 | The Analysis of an Improved Hashing Technique Gaston H. Gonnet, J. Ian Munro |
| 1977 | The Complexity of Priority Queue Maintenance Mark R. Brown |
| 1977 | The Decidability of the Reachability Problem for Vector Addition Systems (Preliminary Version) George S. Sacerdote, Richard L. Tenney |
| 1977 | Universal Classes of Hash Functions (Extended Abstract) Larry Carter, Mark N. Wegman |