9. STOC 1977: Boulder, Colorado, USA
- John E. Hopcroft, Emily P. Friedman, Michael A. Harrison:
Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4-6, 1977, Boulder, Colorado, USA. ACM 1977 - Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest:
An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem. 11-17 - Dana Angluin, Leslie G. Valiant:
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. 30-41 - Leonidas J. Guibas, Edward M. McCreight, Michael F. Plass, Janet R. Roberts:
A New Representation for Linear Lists. 49-60 - George S. Sacerdote, Richard L. Tenney:
The Decidability of the Reachability Problem for Vector Addition Systems (Preliminary Version). 61-76 - Ashok K. Chandra, Philip M. Merlin:
Optimal Implementation of Conjunctive Queries in Relational Data Bases. 77-90 - Gary L. Peterson, Michael J. Fischer:
Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract). 91-97 - Leonard M. Adleman, Kenneth L. Manders:
Reducibility, Randomness, and Intractability (Abstract). 151-163 - Chandra M. R. Kintala, Patrick C. Fischer:
Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract). 178-185 - Juris Hartmanis:
Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version). 223-227 - Nancy A. Lynch, Edward K. Blum:
Efficient Reducibility Between Programming Systems: Preliminary Report. 228-238 - David Harel, Amir Pnueli, Jonathan Stavi:
A Complete Axiomatic System for Proving Deductions about Recursive Programs. 249-260 - David Harel, Albert R. Meyer, Vaughan R. Pratt:
Computability and Completeness in Logics of Programs (Preliminary Report). 261-268 - Michael J. Fischer, Richard E. Ladner:
Propositional Modal Logic of Programs (Extended Abstract). 286-294 - Mike O'Donnell:
Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic. 295-305