stoc76.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1976</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>8. <a href="index.html">STOC</a> 1976</h1> Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3-5, 1976, Hershey, Pennsylvania, USA. ACM 1976 <ul> <li><a name="PapadimitriouS76" href="../../indices/a-tree/p/Papadimitriou:Christos_H=.html">Christos H. Papadimitriou</a>, <a href="../../indices/a-tree/s/Steiglitz:Kenneth.html">Kenneth Steiglitz</a>: Some Complexity Results for the Traveling Salesman Problem. 1-9 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PapadimitriouS76">BibTeX</a></font> <li><a name="GareyGJ76" href="../../indices/a-tree/g/Garey:M=_R=.html">M. R. Garey</a>, <a href="../../indices/a-tree/g/Graham:Ronald_L=.html">Ronald L. Graham</a>, <a href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>: Some NP-Complete Geometric Problems. 10-22 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GareyGJ76">BibTeX</a></font> <li><a name="MandersA76" href="../../indices/a-tree/m/Manders:Kenneth_L=.html">Kenneth L. Manders</a>, <a href="../../indices/a-tree/a/Adleman:Leonard_M=.html">Leonard M. Adleman</a>: NP-Complete Decision Problems for Quadratic Polynomials. 23-29 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MandersA76">BibTeX</a></font> <li><a name="HartmanisB76" href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>, <a href="../../indices/a-tree/b/Berman:Leonard.html">Leonard Berman</a>: On Isomorphisms and Density of NP and Other Complete Sets. 30-40 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HartmanisB76">BibTeX</a></font> <li><a name="Schaefer76" href="../../indices/a-tree/s/Schaefer:Thomas_J=.html">Thomas J. Schaefer</a>: Complexity of Decision Problems Based on Finite Two-Person Perfect-Information Games. 41-49 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Schaefer76">BibTeX</a></font> <li><a name="CardozaLM76" href="../../indices/a-tree/c/Cardoza:E=.html">E. Cardoza</a>, <a href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>: Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report. 50-54 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CardozaLM76">BibTeX</a></font> <li><a name="Hirschberg76" href="../../indices/a-tree/h/Hirschberg:Daniel_S=.html">Daniel S. Hirschberg</a>: Parallel Algorithms for the Transitive Closure and the Connected Component Problems. 55-57 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hirschberg76">BibTeX</a></font> <li><a name="ThompsonK76" href="../../indices/a-tree/t/Thompson:Clark_D=.html">Clark D. Thompson</a>, <a href="../../indices/a-tree/k/Kung:H=_T=.html">H. T. Kung</a>: Sorting on a Mesh-Connected Parallel Computer. 58-64 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ThompsonK76">BibTeX</a></font> <li><a name="Doeppner76" href="../../indices/a-tree/d/Doeppner_Jr=:Thomas_W=.html">Thomas W. Doeppner Jr.</a>: On Abstractions of Parallel Programs. 65-72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Doeppner76">BibTeX</a></font> <li><a name="Owicki76" href="../../indices/a-tree/o/Owicki:Susan_S=.html">Susan S. Owicki</a>: A Consistent and Complete Deductive System for the Verification of Parallel Programs. 73-86 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Owicki76">BibTeX</a></font> <li><a name="Wand76" href="../../indices/a-tree/w/Wand:Mitchell.html">Mitchell Wand</a>: A New Incompleteness Result for Hoare's System. 87-91 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Wand76">BibTeX</a></font> <li><a name="Kimura76" href="../../indices/a-tree/k/Kimura:Takayuki.html">Takayuki Kimura</a>: An Algebraic System for Process Structuring and Interprocess Communication. 92-100 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kimura76">BibTeX</a></font> <li><a name="Kosaraju76" href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>: On Structuring Flowcharts (Preliminary Version). 101-111 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kosaraju76">BibTeX</a></font> <li><a name="GrahamHR76" href="../../indices/a-tree/g/Graham:Susan_L=.html">Susan L. Graham</a>, <a href="../../indices/a-tree/h/Harrison:Michael_A=.html">Michael A. Harrison</a>, <a href="../../indices/a-tree/r/Ruzzo:Walter_L=.html">Walter L. Ruzzo</a>: On Line Context Free Language Recognition in Less than Cubic Time (Extended Abstract). 112-120 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GrahamHR76">BibTeX</a></font> <li><a name="FongU76" href="../../indices/a-tree/f/Fong:Amelia_C=.html">Amelia C. Fong</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Finding the Depth of a Flow Graph. 121-125 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FongU76">BibTeX</a></font> <li><a name="HuntS76" href="../../indices/a-tree/h/Hunt_III:Harry_B=.html">Harry B. Hunt III</a>, <a href="../../indices/a-tree/s/Szymanski:Thomas_G=.html">Thomas G. Szymanski</a>: Dichotomization, Reachability, and the Forbidden Subgraph Problem (Extended Abstract). 126-134 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HuntS76">BibTeX</a></font> <li><a name="IbarraK76" href="../../indices/a-tree/i/Ibarra:Oscar_H=.html">Oscar H. Ibarra</a>, <a href="../../indices/a-tree/k/Kim:Chul_E=.html">Chul E. Kim</a>: A Useful Device for Showing the Solvability of Some Decision Problems. 135-140 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/IbarraK76">BibTeX</a></font> <li><a name="Sudborough76" href="../../indices/a-tree/s/Sudborough:Ivan_Hal.html">Ivan Hal Sudborough</a>: On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store. 141-148 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Sudborough76">BibTeX</a></font> <li><a name="PaulTC76" href="../../indices/a-tree/p/Paul:Wolfgang_J=.html">Wolfgang J. Paul</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>, <a href="../../indices/a-tree/c/Celoni:James_R=.html">James R. Celoni</a>: Space Bounds for a Game of Graphs. 149-160 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PaulTC76">BibTeX</a></font> <li><a name="Galil76" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>: Real-Time Algorithms for String-Matching and Palindrome Recognition. 161-173 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Galil76">BibTeX</a></font> <li><a name="LiptonS76" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: Evaluation of Polynomials with Super-Preconditioning. 174-180 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LiptonS76">BibTeX</a></font> <li><a name="PatersonW76" href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>, <a href="../../indices/a-tree/w/Wegman:Mark_N=.html">Mark N. Wegman</a>: Linear Unification. 181-186 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PatersonW76">BibTeX</a></font> <li><a name="GuibasS76" href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/s/Szemer=eacute=di:Endre.html">Endre Szemerédi</a>: The Analysis of Double Hashing (Extended Abstract). 187-191 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GuibasS76">BibTeX</a></font> <li><a name="Yao76" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: On the Average Behavior of Set Merging Algorithms (Extended Abstract). 192-195 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yao76">BibTeX</a></font> <li><a name="Valiant76" href="../../indices/a-tree/v/Valiant:Leslie_G=.html">Leslie G. Valiant</a>: Universal Circuits (Preliminary Report). 196-203 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Valiant76">BibTeX</a></font> <li><a name="Pippenger76" href="../../indices/a-tree/p/Pippenger:Nicholas.html">Nicholas Pippenger</a>: The Realization of Monotone Boolean Functions (Preliminary Version). 204-210 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pippenger76">BibTeX</a></font> <li><a name="Burkhard76" href="../../indices/a-tree/b/Burkhard:Walter_A=.html">Walter A. Burkhard</a>: Associative Retrieval Trie Hash-Coding. 211-219 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Burkhard76">BibTeX</a></font> <li><a name="BentleyS76" href="../../indices/a-tree/b/Bentley:Jon_Louis.html">Jon Louis Bentley</a>, <a href="../../indices/a-tree/s/Shamos:Michael_Ian.html">Michael Ian Shamos</a>: Divide-and-Conquer in Multidimensional Space. 220-230 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BentleyS76">BibTeX</a></font> <li><a name="LeeP76" href="../../indices/a-tree/l/Lee:D=_T=.html">D. T. Lee</a>, <a href="../../indices/a-tree/p/Preparata:Franco_P=.html">Franco P. Preparata</a>: Location of a Point in a Planar Subdivision and its Applications. 231-235 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LeeP76">BibTeX</a></font> <li><a name="MachteyY76" href="../../indices/a-tree/m/Machtey:Michael.html">Michael Machtey</a>, <a href="../../indices/a-tree/y/Young:Paul.html">Paul Young</a>: Simple Gödel Numberings, Translations, and the P-Hierarchy. 236-243 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MachteyY76">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
