9. STOC 1977: Boulder, Colorado, USA
Alon Itai:
Finding a Minimum Circuit in a Graph.
1-10
Robert Endre Tarjan:
Reference Machines Require Non-linear Time to Maintain Disjoint Sets.
18-29
Mark R. Brown:
The Complexity of Priority Queue Maintenance.
42-48
Dexter Kozen:
Complexity of Finitely Presented Algebras.
164-177
Janos Simon:
On Feasible Numbers (Preliminary Version).
195-207
Juris Hartmanis:
Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version).
223-227
Mike O'Donnell:
Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic.
295-305
data released under the ODC-BY 1.0 license
