stoc80.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1980</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>12. <a href="index.html">STOC</a> 1980</h1> Proceedings of the 12th Annual ACM Symposium on Theory of Computing, April 28-30, 1980, Los Angeles, California, USA. ACM 1980 <ul> <li><a name="MeyerP80" href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>, <a href="../../indices/a-tree/p/Parikh:Rohit.html">Rohit Parikh</a>: Definability in Dynamic Logic. 1-7 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MeyerP80">BibTeX</a></font> <li><a name="Reif80" href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>: Logics for Probabilistic Programming (Extended Abstract). 8-13 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Reif80">BibTeX</a></font> <li><a name="Mirkowska80" href="../../indices/a-tree/m/Mirkowska:Grazyna.html">Grazyna Mirkowska</a>: Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations. 14-21 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Mirkowska80">BibTeX</a></font> <li><a name="Pratt80" href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>: Dynamic Algebras and the Nature of Induction. 22-28 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pratt80">BibTeX</a></font> <li><a name="Ukkonen80" href="../../indices/a-tree/u/Ukkonen:Esko.html">Esko Ukkonen</a>: A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata. 29-38 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ukkonen80">BibTeX</a></font> <li><a name="Plaisted80" href="../../indices/a-tree/p/Plaisted:David_A=.html">David A. Plaisted</a>: On the Distribution of Independent Formulae of Number Theory. 39-44 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Plaisted80">BibTeX</a></font> <li><a name="DeMilloL80" 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>: The Consistency of ``P = NP'' and Related Problems with Fragments of Number Theory. 45-57 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DeMilloL80">BibTeX</a></font> <li><a name="JosephY80" href="../../indices/a-tree/j/Joseph:Deborah.html">Deborah Joseph</a>, <a href="../../indices/a-tree/y/Young:Paul.html">Paul Young</a>: Independence Results in Computer Science? (Preliminary Version). 58-69 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JosephY80">BibTeX</a></font> <li><a name="Lynch80" href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>: Fast Allocation of Nearby Resources in a Distributed System. 70-81 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lynch80">BibTeX</a></font> <li><a name="Angluin80" href="../../indices/a-tree/a/Angluin:Dana.html">Dana Angluin</a>: Local and Global Properties in Networks of Processors (Extended Abstract). 82-93 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Angluin80">BibTeX</a></font> <li><a name="Toueg80" href="../../indices/a-tree/t/Toueg:Sam.html">Sam Toueg</a>: Deadlock- and Livelock-Free Packet Switching Networks. 94-99 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Toueg80">BibTeX</a></font> <li><a name="Brown80" href="../../indices/a-tree/b/Brown:Donna_J=.html">Donna J. Brown</a>: Kraft Storage and Access for List Implementations (Extended Abstract). 100-107 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Brown80">BibTeX</a></font> <li><a name="Strong80" href="../../indices/a-tree/s/Strong:H=_Raymond.html">H. Raymond Strong</a>: Vector Execution of Flow Graphs (Extended Abstract). 108-116 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Strong80">BibTeX</a></font> <li><a name="SadriU80" href="../../indices/a-tree/s/Sadri:Fereidoon.html">Fereidoon Sadri</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: A Complete Axiomatization for a Large Class of Dependencies in Relational Databases. 117-122 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SadriU80">BibTeX</a></font> <li><a name="Fagin80" href="../../indices/a-tree/f/Fagin:Ronald.html">Ronald Fagin</a>: Horn Clauses and Database Dependencies (Extended Abstract). 123-134 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Fagin80">BibTeX</a></font> <li><a name="OvermarsV80" href="../../indices/a-tree/o/Overmars:Mark_H=.html">Mark H. Overmars</a>, <a href="../../indices/a-tree/l/Leeuwen:Jan_van.html">Jan van Leeuwen</a>: Dynamically Maintaining Configurations in the Plane (Detailed Abstract). 135-145 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/OvermarsV80">BibTeX</a></font> <li><a name="ChazelleD80" 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>: Detection is Easier than Computation (Extended Abstract). 146-153 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChazelleD80">BibTeX</a></font> <li><a name="GuibasY80" href="../../indices/a-tree/g/Guibas:Leonidas_J=.html">Leonidas J. Guibas</a>, <a href="../../indices/a-tree/y/Yao:F=_Frances.html">F. Frances Yao</a>: On Translating a Set of Rectangles. 154-160 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GuibasY80">BibTeX</a></font> <li><a name="Tompa80" href="../../indices/a-tree/t/Tompa:Martin.html">Martin Tompa</a>: An Optimal Solution to a Wire-Routing Problem (Preliminary Version). 161-176 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Tompa80">BibTeX</a></font> <li><a name="FischerP80" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>: Optimal Tree Layout (Preliminary Version). 177-189 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FischerP80">BibTeX</a></font> <li><a name="BrentK80" href="../../indices/a-tree/b/Brent:Richard_P=.html">Richard P. Brent</a>, <a href="../../indices/a-tree/k/Kung:H=_T=.html">H. T. Kung</a>: The Chip Complexity of Binary Arithmetic. 190-200 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BrentK80">BibTeX</a></font> <li><a name="Storer80" href="../../indices/a-tree/s/Storer:James_A=.html">James A. Storer</a>: The Node Cost Measure for Embedding Graphs on the Planar Grid (Extended Abstract). 201-210 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Storer80">BibTeX</a></font> <li><a name="Cypher80" href="../../indices/a-tree/c/Cypher:Allen.html">Allen Cypher</a>: An Approach to The k Paths Problem. 211-217 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cypher80">BibTeX</a></font> <li><a name="Lichtenstein80" href="../../indices/a-tree/l/Lichtenstein:David.html">David Lichtenstein</a>: Isomorphism for Graphs Embeddable on the Projective Plane. 218-224 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lichtenstein80">BibTeX</a></font> <li><a name="Miller80" href="../../indices/a-tree/m/Miller:Gary_L=.html">Gary L. Miller</a>: Isomorphism Testing for Graphs of Bounded Genus. 225-235 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Miller80">BibTeX</a></font> <li><a name="FilottiM80" href="../../indices/a-tree/f/Filotti:I=_S=.html">I. S. Filotti</a>, <a href="../../indices/a-tree/m/Mayer:Jack_N=.html">Jack N. Mayer</a>: A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (Working Paper). 236-243 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FilottiM80">BibTeX</a></font> <li><a name="Hoffmann80" href="../../indices/a-tree/h/Hoffmann:Christoph_M=.html">Christoph M. Hoffmann</a>: Testing Isomorphism on Cone Graphs (Extended Abstract). 244-251 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hoffmann80">BibTeX</a></font> <li><a name="KannanL80" href="../../indices/a-tree/k/Kannan:Ravindran.html">Ravindran Kannan</a>, <a href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>: The Orbit Problem is Decidable. 252-261 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KannanL80">BibTeX</a></font> <li><a name="HeintzS80" href="../../indices/a-tree/h/Heintz:Joos.html">Joos Heintz</a>, <a href="../../indices/a-tree/s/Schnorr:Claus=Peter.html">Claus-Peter Schnorr</a>: Testing Polynomials which Are Easy to Compute (Extended Abstract). 262-272 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HeintzS80">BibTeX</a></font> <li><a name="IbarraL80" href="../../indices/a-tree/i/Ibarra:Oscar_H=.html">Oscar H. Ibarra</a>, <a href="../../indices/a-tree/l/Leininger:Brian_S=.html">Brian S. Leininger</a>: The Complexity of the Equivalence Problem for Straight-Line Programs. 273-280 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/IbarraL80">BibTeX</a></font> <li><a name="EhrigM80" href="../../indices/a-tree/e/Ehrig:Hartmut.html">Hartmut Ehrig</a>, <a href="../../indices/a-tree/m/Mahr:Bernd.html">Bernd Mahr</a>: Complexity of Implementations on the Level of Algebraic Specifications. 281-293 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/EhrigM80">BibTeX</a></font> <li><a name="BorodinC80" href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>, <a href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation. 294-301 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BorodinC80">BibTeX</a></font> <li><a name="KarpL80" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>: Some Connections between Nonuniform and Uniform Complexity Classes. 302-309 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarpL80">BibTeX</a></font> <li><a name="Hong80" href="../../indices/a-tree/h/Hong:Jia=Wei.html">Jia-Wei Hong</a>: On Some Deterministic Space Complexity Problems. 310-317 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hong80">BibTeX</a></font> <li><a name="Yap80" href="../../indices/a-tree/y/Yap:Chee=Keng.html">Chee-Keng Yap</a>: Space-time Tradeoffs and First Order Problems in a Model of Programs. 318-325 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yap80">BibTeX</a></font> <li><a name="CarlsonS80" href="../../indices/a-tree/c/Carlson:David_A=.html">David A. Carlson</a>, <a href="../../indices/a-tree/s/Savage:John_E=.html">John E. Savage</a>: Graph Pebbling with Many Free Pebbles can be Difficult. 326-332 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CarlsonS80">BibTeX</a></font> <li><a name="JaJa80" href="../../indices/a-tree/j/J=aacute=J=aacute=:Joseph.html">Joseph JáJá</a>: Time-Space Tradeoffs for some Algebraic Problems. 339-350 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JaJa80">BibTeX</a></font> <li><a name="Pippenger80" href="../../indices/a-tree/p/Pippenger:Nicholas.html">Nicholas Pippenger</a>: Comparative Schematology and Pebbling with Auxiliary Pushdowns (Preliminary Version). 351-356 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pippenger80">BibTeX</a></font> <li><a name="PaulSS80" href="../../indices/a-tree/p/Paul:Wolfgang_J=.html">Wolfgang J. Paul</a>, <a href="../../indices/a-tree/s/Seiferas:Joel_I=.html">Joel I. Seiferas</a>, <a href="../../indices/a-tree/s/Simon:Janos.html">Janos Simon</a>: An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version). 357-367 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PaulSS80">BibTeX</a></font> <li><a name="KarpT80" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract). 368-377 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarpT80">BibTeX</a></font> <li><a name="Bloniarz80" href="../../indices/a-tree/b/Bloniarz:Peter_A=.html">Peter A. Bloniarz</a>: A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n). 378-384 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Bloniarz80">BibTeX</a></font> <li><a name="ReifS80" href="../../indices/a-tree/r/Reif:John_H=.html">John H. Reif</a>, <a href="../../indices/a-tree/s/Spirakis:Paul_G=.html">Paul G. Spirakis</a>: Random Matroids. 385-397 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ReifS80">BibTeX</a></font> <li><a name="SupowitPR80" href="../../indices/a-tree/s/Supowit:Kenneth_J=.html">Kenneth J. Supowit</a>, <a href="../../indices/a-tree/p/Plaisted:David_A=.html">David A. Plaisted</a>, <a href="../../indices/a-tree/r/Reingold:Edward_M=.html">Edward M. Reingold</a>: Heuristics for Weighted Perfect Matching. 398-419 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/SupowitPR80">BibTeX</a></font> <li><a name="FredericksonJ80" href="../../indices/a-tree/f/Frederickson:Greg_N=.html">Greg N. Frederickson</a>, <a href="../../indices/a-tree/j/Johnson:Donald_B=.html">Donald B. Johnson</a>: Generalized Selection and Ranking (Preliminary Version). 420-428 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FredericksonJ80">BibTeX</a></font> <li><a name="Yao80" href="../../indices/a-tree/y/Yao:F=_Frances.html">F. Frances Yao</a>: Efficient Dynamic Programming Using Quadrangle Inequalities. 429-435 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Yao80">BibTeX</a></font> <li><a name="Lloyd80" href="../../indices/a-tree/l/Lloyd:Errol_L=.html">Errol L. Lloyd</a>: Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract). 436-446 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lloyd80">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
