stoc77.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1977</title><link href="../../../dblp.css" rel="stylesheet" type="text/css" /></head> <body> <table width="100%"><tr><td align="left"><a href="../../index.html"><img alt="dblp.uni-trier.de" src="../../Logo.gif" border=0 height=60 width=170></a></td> <td align="right"><a href="http://www.uni-trier.de"><img alt="www.uni-trier.de" src="../../logo_universitaet-trier.gif" border=0 height=48 width=215></a></td></tr></table> <h1>9. <a href="index.html">STOC</a> 1977</h1> Proceedings of the 9th Annual ACM Symposium on Theory of Computing, May 4-6, 1977, Boulder, Colorado, USA. ACM 1977 <ul> <li><a name="Itai77" href="../../indices/a-tree/i/Itai:Alon.html">Alon Itai</a>: Finding a Minimum Circuit in a Graph. 1-10 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Itai77">BibTeX</a></font> <li><a name="YaoAR77" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>, <a href="../../indices/a-tree/a/Avis:David.html">David Avis</a>, <a href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>: An Omega(n^2 log n) Lower Bound to the Shortest Paths Problem. 11-17 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/YaoAR77">BibTeX</a></font> <li><a name="Tarjan77" href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Reference Machines Require Non-linear Time to Maintain Disjoint Sets. 18-29 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Tarjan77">BibTeX</a></font> <li><a name="AngluinV77" href="../../indices/a-tree/a/Angluin:Dana.html">Dana Angluin</a>, <a href="../../indices/a-tree/v/Valiant:Leslie_G=.html">Leslie G. Valiant</a>: Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. 30-41 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AngluinV77">BibTeX</a></font> <li><a name="Brown77" href="../../indices/a-tree/b/Brown:Mark_R=.html">Mark R. Brown</a>: The Complexity of Priority Queue Maintenance. 42-48 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Brown77">BibTeX</a></font> <li><a name="GuibasMPR77" href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/m/McCreight:Edward_M=.html">Edward M. McCreight</a>, <a href="../../indices/a-tree/p/Plass:Michael_F=.html">Michael F. Plass</a>, <a href="../../indices/a-tree/r/Roberts:Janet_R=.html">Janet R. Roberts</a>: A New Representation for Linear Lists. 49-60 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GuibasMPR77">BibTeX</a></font> <li><a name="SacerdoteT77" href="../../indices/a-tree/s/Sacerdote:George_S=.html">George S. Sacerdote</a>, <a href="../../indices/a-tree/t/Tenney:Richard_L=.html">Richard L. Tenney</a>: The Decidability of the Reachability Problem for Vector Addition Systems (Preliminary Version). 61-76 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SacerdoteT77">BibTeX</a></font> <li><a name="ChandraM77" href="../../indices/a-tree/c/Chandra:Ashok_K=.html">Ashok K. Chandra</a>, <a href="../../indices/a-tree/m/Merlin:Philip_M=.html">Philip M. Merlin</a>: Optimal Implementation of Conjunctive Queries in Relational Data Bases. 77-90 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChandraM77">BibTeX</a></font> <li><a name="PetersonF77" href="../../indices/a-tree/p/Peterson:Gary_L=.html">Gary L. Peterson</a>, <a href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>: Economical Solutions for the Critical Section Problem in a Distributed System (Extended Abstract). 91-97 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PetersonF77">BibTeX</a></font> <li><a name="Rosenthal77" href="../../indices/a-tree/r/Rosenthal:Arnie.html">Arnie Rosenthal</a>: Nonserial Dynamic Programming Is Optimal. 98-105 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rosenthal77">BibTeX</a></font> <li><a name="CarterW77" href="../../indices/a-tree/c/Carter:Larry.html">Larry Carter</a>, <a href="../../indices/a-tree/w/Wegman:Mark_N=.html">Mark N. Wegman</a>: Universal Classes of Hash Functions (Extended Abstract). 106-112 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CarterW77">BibTeX</a></font> <li><a name="GonnetM77" href="../../indices/a-tree/g/Gonnet:Gaston_H=.html">Gaston H. Gonnet</a>, <a href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>: The Analysis of an Improved Hashing Technique. 113-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GonnetM77">BibTeX</a></font> <li><a name="Beatty77" href="../../indices/a-tree/b/Beatty:John_C=.html">John C. Beatty</a>: Iteration Theorems for LL(k) Languages. 122-131 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Beatty77">BibTeX</a></font> <li><a name="PrabhalaS77" href="../../indices/a-tree/p/Prabhala:Bhaskaram.html">Bhaskaram Prabhala</a>, <a href="../../indices/a-tree/s/Sethi:Ravi.html">Ravi Sethi</a>: A Comparison of Instruction Sets for Stack Machines. 132-142 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PrabhalaS77">BibTeX</a></font> <li><a name="Miller77" href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>: Graph Isomorphism, General Remarks. 143-150 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Miller77">BibTeX</a></font> <li><a name="AdlemanM77" href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>, <a href="../../indices/a-tree/m/Manders:Kenneth_L=.html">Kenneth L. Manders</a>: Reducibility, Randomness, and Intractability (Abstract). 151-163 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AdlemanM77">BibTeX</a></font> <li><a name="Kozen77" href="../../indices/a-tree/k/Kozen:Dexter.html">Dexter Kozen</a>: Complexity of Finitely Presented Algebras. 164-177 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kozen77">BibTeX</a></font> <li><a name="KintalaF77" href="../../indices/a-tree/k/Kintala:Chandra_M=_R=.html">Chandra M. R. Kintala</a>, <a href="../../indices/a-tree/f/Fischer:Patrick_C=.html">Patrick C. Fischer</a>: Computations with a Restricted Number of Nondeterministic Steps (Extended Abstract). 178-185 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KintalaF77">BibTeX</a></font> <li><a name="SimonG77" href="../../indices/a-tree/s/Simon:Istv=aacute=n.html">István Simon</a>, <a href="../../indices/a-tree/g/Gill:John.html">John Gill</a>: Polynomial Reducibilities and Upward Diagonalizations. 186-194 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SimonG77">BibTeX</a></font> <li><a name="Simon77" href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>: On Feasible Numbers (Preliminary Version). 195-207 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Simon77">BibTeX</a></font> <li><a name="Sudborough77" href="../../indices/a-tree/s/Sudborough:Ivan_Hal.html">Ivan Hal Sudborough</a>: Separating Tape Bounded Auxiliary Pushdown Automata Classes. 208-217 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Sudborough77">BibTeX</a></font> <li><a name="Paul77" href="../../indices/a-tree/p/Paul:Wolfgang_J=.html">Wolfgang J. Paul</a>: On Time Hierarchies. 218-222 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Paul77">BibTeX</a></font> <li><a name="Hartmanis77" href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>: Relations Between Diagonalization, Proof Systems, and Complexity Gaps (Preliminary Version). 223-227 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hartmanis77">BibTeX</a></font> <li><a name="LynchB77" href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>, <a href="../../indices/a-tree/b/Blum:Edward_K=.html">Edward K. Blum</a>: Efficient Reducibility Between Programming Systems: Preliminary Report. 228-238 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LynchB77">BibTeX</a></font> <li><a name="LeongS77" href="../../indices/a-tree/l/Leong:Benton_L=.html">Benton L. Leong</a>, <a href="../../indices/a-tree/s/Seiferas:Joel_I=.html">Joel I. Seiferas</a>: New Real-Time Simulations of Multihead Tape Units. 239-248 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LeongS77">BibTeX</a></font> <li><a name="HarelPS77" href="../../indices/a-tree/h/Harel:David.html">David Harel</a>, <a href="../../indices/a-tree/p/Pnueli:Amir.html">Amir Pnueli</a>, <a href="../../indices/a-tree/s/Stavi:Jonathan.html">Jonathan Stavi</a>: A Complete Axiomatic System for Proving Deductions about Recursive Programs. 249-260 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HarelPS77">BibTeX</a></font> <li><a name="HarelMP77" href="../../indices/a-tree/h/Harel:David.html">David Harel</a>, <a href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>, <a href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>: Computability and Completeness in Logics of Programs (Preliminary Report). 261-268 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HarelMP77">BibTeX</a></font> <li><a name="Constable77" href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>: On the Theory of Programming Logics. 269-285 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Constable77">BibTeX</a></font> <li><a name="FischerL77" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/l/Ladner:Richard_E=.html">Richard E. Ladner</a>: Propositional Modal Logic of Programs (Extended Abstract). 286-294 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FischerL77">BibTeX</a></font> <li><a name="ODonnell77" href="../../indices/a-tree/o/O=Donnell:Mike.html">Mike O'Donnell</a>: Subtree Replacement Systems: A Unifying Theory for Recursive Equations, LISP, Lucid and Combinatory Logic. 295-305 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ODonnell77">BibTeX</a></font> <li><a name="HennessyA77" href="../../indices/a-tree/h/Hennessy:Matthew.html">Matthew Hennessy</a>, <a href="../../indices/a-tree/a/Ashcroft:Edward_A=.html">Edward A. Ashcroft</a>: Parameter-Passing Mechanisms and Nondeterminism. 306-311 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HennessyA77">BibTeX</a></font> </ul><p><div class="footer"> <a href="../../index.html">Home</a> | <a href="../indexa.html">Conferences</a> | <a href="../../journals/index.html">Journals</a> | <a href="../../series/index.html">Series</a> | <a href="../../about/faq.html">FAQ</a> — Search: <a href="http://dblp.l3s.de">Faceted</a> | <a href="http://dblp.mpi-inf.mpg.de/dblp-mirror/index.php">Complete</a> | <a href="../../indices/a-tree/index.html">Author</a></div> <small><a href="../../copyright.html">Copyright ©</a> Sat May 16 23:43:09 2009 by <a href="http://www.informatik.uni-trier.de/~ley/addr.html">Michael Ley</a> (<a href="mailto:ley@uni-trier.de">ley@uni-trier.de</a>)</small></p></body></html>
SIGMOD News
