| 1976 | 17th Annual Symposium on Foundations of Computer Science, Houston, Texas, USA, 25-27 October 1976 |
| 1976 | A Linear Time Algorithm for Deciding Security Anita K. Jones, Richard J. Lipton, Lawrence Snyder |
| 1976 | A Second Step toward the Polynomial Hierarchy Theodore P. Baker, Alan L. Selman |
| 1976 | Algebraic Families of Interpretations Bruno Courcelle, Maurice Nivat |
| 1976 | Alternation Ashok K. Chandra, Larry J. Stockmeyer |
| 1976 | An Algebraic Formulation of Knuthian Semantics Laurian M. Chirica, David F. Martin |
| 1976 | Approximation Algorithms for some Routing Problems Greg N. Frederickson, Matthew S. Hecht, Chul E. Kim |
| 1976 | Assignment Commands and Array Structures Peter J. Downey, Ravi Sethi |
| 1976 | Categories for Fixpoint-Semantics Daniel J. Lehmann |
| 1976 | Characterization of the Synchronization Languages for PV Systems Peter B. Henderson, Yechezkel Zalcstein |
| 1976 | Complexity of Trie Index Construction (Extended Abstract) Douglas Comer, Ravi Sethi |
| 1976 | Concurrency Control for Database Systems Richard Edwin Stearns, Philip M. Lewis II, Daniel J. Rosenkrantz |
| 1976 | Diophantine Complexity Leonard M. Adleman, Kenneth L. Manders |
| 1976 | Geometric Intersection Problems Michael Ian Shamos, Dan Hoey |
| 1976 | Graph Grammars and Global Program Data Flow Analysis Rodney Farrow, Ken Kennedy, Linda Zucconi |
| 1976 | Lower Bounds from Complex Function Theory Michael Ian Shamos, Gideon Yuval |
| 1976 | On Parallelism in Turing Machines Dexter Kozen |
| 1976 | On the Evaluation of Powers and Related Problems (Preliminary Version) Nicholas Pippenger |
| 1976 | On the Structure of Complete Sets: Almost Everywhere Complexity and Infinitely Often Speedup Leonard Berman |
| 1976 | Parenthesis Generators Luc Boasson, Maurice Nivat |
| 1976 | Rational Algebraic Theories and Fixed-Point Solutions Jesse B. Wright, James W. Thatcher, Eric G. Wagner, Joseph A. Goguen |
| 1976 | Recognizing Certain Repetitions and Reversals Within Strings Zvi Galil, Joel I. Seiferas |
| 1976 | Self-Organizing Binary Search Trees Brian Allen, J. Ian Munro |
| 1976 | Semantical Considerations on Floyd-Hoare Logic Vaughan R. Pratt |
| 1976 | Simple Languages and Free Schemes Emily P. Friedman |
| 1976 | Some Polynomial and Integer Divisibility Problems Are NP-Hard David A. Plaisted |
| 1976 | The Analysis of Hashing Algorithms that Exhibit k-ary Clustering Leonidas J. Guibas |
| 1976 | The Complexity of Searching an Ordered Random Table (Extended Abstract) Andrew Chi-Chih Yao, F. Frances Yao |
| 1976 | The Mutual Exclusion Problem for Unreliable Processes: Preliminary Report Ronald L. Rivest, Vaughan R. Pratt |
| 1976 | Using Comparison Trees to Derive Lower Bounds for Selection Problems Frank Fussenegger, Harold N. Gabow |
| 1976 | Variations of a New Machine Model Jan van Leeuwen |
| 1976 | k+1 Heads Are Better than k Andrew Chi-Chih Yao, Ronald L. Rivest |