stoc79.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1979</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>11. <a href="index.html">STOC</a> 1979</h1> Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA. ACM 1979 <ul> <li><a name="ValdesTL79" href="../../indices/a-tree/v/Valdes:Jacobo.html">Jacobo Valdes</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>, <a href="../../indices/a-tree/l/Lawler:Eugene_L=.html">Eugene L. Lawler</a>: The recognition of Series Parallel digraphs. 1-12 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ValdesTL79">BibTeX</a></font> <li><a name="GalilN79" href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>, <a href="../../indices/a-tree/n/Naamad:Amnon.html">Amnon Naamad</a>: Network Flow and Generalized Path Compression. 13-26 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GalilN79">BibTeX</a></font> <li><a name="FilottiMR79" href="../../indices/a-tree/f/Filotti:I=_S=.html">I. S. Filotti</a>, <a href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>, <a href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: On Determining the Genus of a Graph in O(v^O(g)) Steps. 27-37 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FilottiMR79">BibTeX</a></font> <li><a name="ChazelleD79" href="../../indices/a-tree/c/Chazelle:Bernard.html">Bernard Chazelle</a>, <a href="../../indices/a-tree/d/Dobkin:David_P=.html">David P. Dobkin</a>: Decomposing a Polygon into its Convex Parts. 38-48 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChazelleD79">BibTeX</a></font> <li><a name="FlajoletFV79" href="../../indices/a-tree/f/Flajolet:Philippe.html">Philippe Flajolet</a>, <a href="../../indices/a-tree/f/Fran=ccedil=on:Jean.html">Jean Françon</a>, <a href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: Computing Integrated Costs of Sequences of Operations with Application to Dictionaries. 49-61 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FlajoletFV79">BibTeX</a></font> <li><a name="Fredman79" href="../../indices/a-tree/f/Fredman:Michael_L=.html">Michael L. Fredman</a>: A Near Optimal Data Structure for a Type of Range Query Problem. 62-66 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Fredman79">BibTeX</a></font> <li><a name="Kosaraju79" href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>: On a Multidimensional Search Problem (Preliminary Version). 67-73 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kosaraju79">BibTeX</a></font> <li><a name="SedgewickS79" href="../../indices/a-tree/s/Sedgewick:Robert.html">Robert Sedgewick</a>, <a href="../../indices/a-tree/s/Szymanski:Thomas_G=.html">Thomas G. Szymanski</a>: The Complexity of Finding Periods. 74-80 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SedgewickS79">BibTeX</a></font> <li><a name="Thompson79" href="../../indices/a-tree/t/Thompson:Clark_D=.html">Clark D. Thompson</a>: Area-Time Complexity for VLSI. 81-88 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Thompson79">BibTeX</a></font> <li><a name="TouegU79" href="../../indices/a-tree/t/Toueg:Sam.html">Sam Toueg</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Deadlock-Free Packet Switching Networks. 89-98 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/TouegU79">BibTeX</a></font> <li><a name="RosenbergWG79" href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>, <a href="../../indices/a-tree/w/Wood:Derick.html">Derick Wood</a>, <a href="../../indices/a-tree/g/Galil:Zvi.html">Zvi Galil</a>: Storage Representations for Tree-Like Data Structures. 99-107 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RosenbergWG79">BibTeX</a></font> <li><a name="MunroS79" href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>, <a href="../../indices/a-tree/s/Suwanda:Hendra.html">Hendra Suwanda</a>: Implicit Data Structures (Preliminary Draft). 108-117 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MunroS79">BibTeX</a></font> <li><a name="Shamir79" href="../../indices/a-tree/s/Shamir:Adi.html">Adi Shamir</a>: On the Cryptocomplexity of Knapsack Systems. 118-129 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Shamir79">BibTeX</a></font> <li><a name="Angluin79" href="../../indices/a-tree/a/Angluin:Dana.html">Dana Angluin</a>: Finding Patterns Common to a Set of Strings (Extended Abstract). 130-141 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Angluin79">BibTeX</a></font> <li><a name="GurariI79" href="../../indices/a-tree/g/Gurari:Eitan_M=.html">Eitan M. Gurari</a>, <a href="../../indices/a-tree/i/Ibarra:Oscar_H=.html">Oscar H. Ibarra</a>: The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs. 142-152 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GurariI79">BibTeX</a></font> <li><a name="DeMilloL79" href="../../indices/a-tree/d/DeMillo:Richard_A=.html">Richard A. DeMillo</a>, <a href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>: Some Connections between Mathematical Logic and Complexity Theory. 153-159 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DeMilloL79">BibTeX</a></font> <li><a name="Berman79" href="../../indices/a-tree/b/Berman:Francine.html">Francine Berman</a>: A Completeness Technique for D-Axiomatizable Semantics. 160-166 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Berman79">BibTeX</a></font> <li><a name="MeyerW79" href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>, <a href="../../indices/a-tree/w/Winklmann:Karl.html">Karl Winklmann</a>: On the Expressive Power of Dynamic Logic (Preliminary Report). 167-175 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MeyerW79">BibTeX</a></font> <li><a name="ODonnell79" href="../../indices/a-tree/o/O=Donnell:Michael.html">Michael O'Donnell</a>: A Programming Language Theorem Which Is Independent of Peano Arithmetic. 176-188 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ODonnell79">BibTeX</a></font> <li><a name="Valiant79" href="../../indices/a-tree/v/Valiant:Leslie_G=.html">Leslie G. Valiant</a>: Negation Can Be Exponentially Powerful. 189-196 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Valiant79">BibTeX</a></font> <li><a name="JaJa79" href="../../indices/a-tree/j/J=aacute=J=aacute=:Joseph.html">Joseph JáJá</a>: On the Complexity of Bilinear Forms with Commutativity. 197-208 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JaJa79">BibTeX</a></font> <li><a name="Yao79" href="../../indices/a-tree/y/Yao:Andrew_Chi=Chih.html">Andrew Chi-Chih Yao</a>: Some Complexity Questions Related to Distributive Computing (Preliminary Report). 209-213 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yao79">BibTeX</a></font> <li><a name="Ladner79" href="../../indices/a-tree/l/Ladner:Richard_E=.html">Richard E. Ladner</a>: The Complexity of Problems in Systems of Communicating Sequential Processes (Extended Abstract). 214-223 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ladner79">BibTeX</a></font> <li><a name="Peterson79" href="../../indices/a-tree/p/Peterson:Gary_L=.html">Gary L. Peterson</a>: Time-Space Trade-Offs for Asynchronous Parallel Models: Reducibilities and Equivalences. 224-230 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Peterson79">BibTeX</a></font> <li><a name="GilbertLT79" href="../../indices/a-tree/g/Gilbert:John_R=.html">John R. Gilbert</a>, <a href="../../indices/a-tree/l/Lengauer:Thomas.html">Thomas Lengauer</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: The Pebbling Problem is Complete in Polynomial Space. 237-248 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GilbertLT79">BibTeX</a></font> <li><a name="LengauerT79" href="../../indices/a-tree/l/Lengauer:Thomas.html">Thomas Lengauer</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Upper and Lower Bounds on Time-Space Tradeoffs. 262-277 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LengauerT79">BibTeX</a></font> <li><a name="Long79" href="../../indices/a-tree/l/Long:Timothy_J=.html">Timothy J. Long</a>: On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract). 278-287 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Long79">BibTeX</a></font> <li><a name="Reif79" href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: Universal Games of Incomplete Information. 288-308 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Reif79">BibTeX</a></font> <li><a name="ChandraH79" href="../../indices/a-tree/c/Chandra:Ashok_K=.html">Ashok K. Chandra</a>, <a href="../../indices/a-tree/h/Harel:David.html">David Harel</a>: Computable Queries for Relational Data Bases (Preliminary Report). 309-318 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChandraH79">BibTeX</a></font> <li><a name="BeeriMSU79" href="../../indices/a-tree/b/Beeri:Catriel.html">Catriel Beeri</a>, <a href="../../indices/a-tree/m/Mendelzon:Alberto_O=.html">Alberto O. Mendelzon</a>, <a href="../../indices/a-tree/s/Sagiv:Yehoshua.html">Yehoshua Sagiv</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Equivalence of Relational Database Schemes. 319-329 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BeeriMSU79">BibTeX</a></font> <li><a name="Maier79" href="../../indices/a-tree/m/Maier:David.html">David Maier</a>: Minimum Covers in the Relational Database Model (Extended Abstract). 330-337 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Maier79">BibTeX</a></font> <li><a name="Cook79" href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: Deterministic CFL's Are Accepted Simultaneously in Polynomial Time and Log Squared Space. 338-345 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cook79">BibTeX</a></font> <li><a name="Ruzzo79" href="../../indices/a-tree/r/Ruzzo:Walter_L=.html">Walter L. Ruzzo</a>: Tree-Size Bounded Alternation. 352-359 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ruzzo79">BibTeX</a></font> <li><a name="Sipser79" href="../../indices/a-tree/s/Sipser:Michael.html">Michael Sipser</a>: Lower Bounds on the Size of Sweeping Automata. 360-364 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Sipser79">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
