Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic Scholar9th 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 1977Alon Itai:
Finding a Minimum Circuit in a Graph. 1-10Andrew Chi-Chih Yao, David Avis, Ronald L. Rivest:
An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem. 11-17Robert Endre Tarjan:
Reference Machines Require Non-linear Time to Maintain Disjoint Sets. 18-29Dana Angluin, Leslie G. Valiant:
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. 30-41Mark R. Brown:
The Complexity of Priority Queue Maintenance. 42-48Leonidas J. Guibas, Edward M. McCreight, Michael F. Plass, Janet R. Roberts:
A New Representation for Linear Lists. 49-60George S. Sacerdote, Richard L. Tenney:
The Decidability of the Reachability Problem for Vector Addition Systems (Preliminary Version). 61-76Ashok K. Chandra, Philip M. Merlin:
Optimal Implementation of Conjunctive Queries in Relational Data Bases. 77-90Gary L. Peterson, Michael J. Fischer:
Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract). 91-97Arnie Rosenthal:
Nonserial Dynamic Programming Is Optimal. 98-105Larry Carter, Mark N. Wegman:
Universal Classes of Hash Functions (Extended Abstract). 106-112Gaston H. Gonnet, J. Ian Munro:
The Analysis of an Improved Hashing Technique. 113-121John C. Beatty:
Iteration Theorems for LL(k) Languages. 122-131Bhaskaram Prabhala, Ravi Sethi:
A Comparison of Instruction Sets for Stack Machines. 132-142Gary L. Miller:
Graph Isomorphism, General Remarks. 143-150Leonard M. Adleman, Kenneth L. Manders:
Reducibility, Randomness, and Intractability (Abstract). 151-163Dexter Kozen:
Complexity of Finitely Presented Algebras. 164-177Chandra M. R. Kintala, Patrick C. Fischer:
Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract). 178-185István Simon, John Gill:
Polynomial Reducibilities and Upward Diagonalizations. 186-194Janos Simon:
On Feasible Numbers (Preliminary Version). 195-207Ivan Hal Sudborough:
Separating Tape Bounded Auxiliary Pushdown Automata Classes. 208-217Wolfgang J. Paul:
On Time Hierarchies. 218-222Juris Hartmanis:
Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version). 223-227Nancy A. Lynch, Edward K. Blum:
Efficient Reducibility Between Programming Systems: Preliminary Report. 228-238Benton L. Leong, Joel I. Seiferas:
New Real-Time Simulations of Multihead Tape Units. 239-248David Harel, Amir Pnueli, Jonathan Stavi:
A Complete Axiomatic System for Proving Deductions about Recursive Programs. 249-260David Harel, Albert R. Meyer, Vaughan R. Pratt:
Computability and Completeness in Logics of Programs (Preliminary Report). 261-268Robert L. Constable:
On the Theory of Programming Logics. 269-285Michael J. Fischer, Richard E. Ladner:
Propositional Modal Logic of Programs (Extended Abstract). 286-294Mike O'Donnell:
Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic. 295-305Matthew Hennessy, Edward A. Ashcroft:
Parameter-Passing Mechanisms and Nondeterminism. 306-311
last updated on 2019-10-21 23:33 CEST by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
