| 1977 | The Temporal Logic of Programs | Amir Pnueli |
| 1977 | New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems | David A. Plaisted |
| 1977 | Fast Decision Algorithms Based on Union and Find | Greg Nelson, Derek C. Oppen |
| 1977 | A Space Efficient Method for the Lowest Common Ancestor Problem and an Application to Finding Negative Cycles | David Maier |
| 1977 | On Triangulations of a Set of Points in the Plane | Errol L. Lloyd |
| 1977 | Application of a Planar Separator Theorem | Richard J. Lipton, Robert Endre Tarjan |
| 1977 | A Necessary and Sufficient Condition for the Existence of Hoare Logics | Richard J. Lipton |
| 1977 | A New Decidable Problem, with Applications (Extended Abstract) | Harry R. Lewis |
| 1977 | Data Types (Extended Abstract) | Daniel Lehmann, Michael B. Smyth |
| 1977 | Fast Approximation Algorithms for Knapsack Problems | Eugene L. Lawler |
| 1977 | An Efficient Parallel Garbage Collection System and Its Correctness Proof | H. T. Kung, S. W. Song |
| 1977 | Lower Bounds for Natural Proof Systems | Dexter Kozen |
| 1977 | Several Results in Program Size Complexity | Howard P. Katseff, Michael Sipser |
| 1977 | The Unsolvability of the Equivalence Problem for epsilon-free NGSM's with Unary Input (Output) Alphabet and Applications | Oscar H. Ibarra |
| 1977 | The Power of Commutativity | Laurent Hyafil |
| 1977 | Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems | Grard P. Huet |
| 1977 | A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm | Leonidas J. Guibas, Andrew M. Odlyzko |
| 1977 | Saving Space in Fast String-Matching | Zvi Galil, Joel I. Seiferas |
| 1977 | On the Average Number of Registers Required for Evaluating Arithmetic Expressions | Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin |
| 1977 | Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation | Edward G. Coffman Jr., Joseph Y.-T. Leung |
| 1977 | Program Invariants as Fixed Points (Preliminary Reports) | Edmund M. Clarke |
| 1977 | Language Representation Theorems: How to Generate the R. E. Sets from the Regular Sets | Ronald V. Book |
| 1977 | On the Capability of Finite Automata in 2 and 3 Dimensional Space | Manuel Blum, William J. Sakoda |
| 1977 | Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report | Leonard Berman |
| 1977 | Recursion Theoretic Characterizations of Complexity Theoretic Properties | Victor L. Bennison, Robert I. Soare |