stoc74.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1974</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>6. <a href="index.html">STOC</a> 1974</h1> Proceedings of the 6th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1974, Seattle, Washington, USA. ACM 1974 <ul> <li><a name="Chandra74" href="../../indices/a-tree/c/Chandra:Ashok_K=.html">Ashok K. Chandra</a>: Degrees of Translatability and Canonical Forms in Program Schemas: Part I. 1-12 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Chandra74">BibTeX</a></font> <li><a name="CourcelleV74" href="../../indices/a-tree/c/Courcelle:Bruno.html">Bruno Courcelle</a>, <a href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: Semantics and Axiomatics of a Simple Recursive Language. 13-26 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CourcelleV74">BibTeX</a></font> <li><a name="Valiant74" href="../../indices/a-tree/v/Valiant:Leslie_G=.html">Leslie G. Valiant</a>: The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata. 27-32 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Valiant74">BibTeX</a></font> <li><a name="CookS74" href="../../indices/a-tree/c/Cook:Stephen.html">Stephen Cook</a>, <a href="../../indices/a-tree/s/Sethi:Ravi.html">Ravi Sethi</a>: Storage Requirements for Deterministic Polynomial Time Recognizable Languages. 33-39 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CookS74">BibTeX</a></font> <li><a name="JonesL74" href="../../indices/a-tree/j/Jones:Neil_D=.html">Neil D. Jones</a>, <a href="../../indices/a-tree/l/Laaser:William_T=.html">William T. Laaser</a>: Complete Problems for Deterministic Polynomial Time. 40-46 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JonesL74">BibTeX</a></font> <li><a name="GareyJS74" href="../../indices/a-tree/g/Garey:M=_R=.html">M. R. Garey</a>, <a href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: Some Simplified NP-Complete Problems. 47-63 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GareyJS74">BibTeX</a></font> <li><a name="HuntR74" href="../../indices/a-tree/h/Hunt_III:Harry_B=.html">Harry B. Hunt III</a>, <a href="../../indices/a-tree/r/Rosenkrantz:Daniel_J=.html">Daniel J. Rosenkrantz</a>: Computational Parallels between the Regular and Context-Free Languages. 64-74 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HuntR74">BibTeX</a></font> <li><a name="EhrenfeuchtZ74" href="../../indices/a-tree/e/Ehrenfeucht:Andrzej.html">Andrzej Ehrenfeucht</a>, <a href="../../indices/a-tree/z/Zeiger:H=_Paul.html">H. Paul Zeiger</a>: Complexity Measures for Regular Expressions. 75-79 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/EhrenfeuchtZ74">BibTeX</a></font> <li><a name="Pratt74" href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>: The Power of Negative Thinking in Multiplying Boolean Matrices. 80-83 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pratt74">BibTeX</a></font> <li><a name="Kirkpatrick74" href="../../indices/a-tree/k/Kirkpatrick:David_G=.html">David G. Kirkpatrick</a>: Determining Graph Properties from Matrix Representations. 84-90 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kirkpatrick74">BibTeX</a></font> <li><a name="Gill74" href="../../indices/a-tree/g/Gill_III:John_T=.html">John T. Gill III</a>: Computational Complexity of Probabilistic Turing Machines. 91-95 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Gill74">BibTeX</a></font> <li><a name="Mehlhorn74" href="../../indices/a-tree/m/Mehlhorn:Kurt.html">Kurt Mehlhorn</a>: Polynomial and Abstract Subrecursive Classes. 96-109 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Mehlhorn74">BibTeX</a></font> <li><a name="LadnerLS74" href="../../indices/a-tree/l/Ladner:Richard_E=.html">Richard E. Ladner</a>, <a href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>, <a href="../../indices/a-tree/s/Selman:Alan_L=.html">Alan L. Selman</a>: Comparisons of Polynomial-Time Reducibilities. 110-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LadnerLS74">BibTeX</a></font> <li><a name="PrattRS74" href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>, <a href="../../indices/a-tree/r/Rabin:Michael_O=.html">Michael O. Rabin</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: A Characterization of the Power of Vector Machines. 122-134 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PrattRS74">BibTeX</a></font> <li><a name="CookR74" href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>, <a href="../../indices/a-tree/r/Reckhow:Robert_A=.html">Robert A. Reckhow</a>: On the Lengths of Proofs in the Propositional Calculus (Preliminary Version). 135-148 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CookR74">BibTeX</a></font> <li><a name="Rackoff74" href="../../indices/a-tree/r/Rackoff:Charles.html">Charles Rackoff</a>: On the Complexity of the Theories of Weak Direct Products: A Preliminary Report. 149-160 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rackoff74">BibTeX</a></font> <li><a name="Robertson74" href="../../indices/a-tree/r/Robertson:Edward_L=.html">Edward L. Robertson</a>: Structure of Complexity in the Weak Monadic Second-Order Theories of the Natural Numbers. 161-171 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Robertson74">BibTeX</a></font> <li><a name="HopcroftW74" href="../../indices/a-tree/h/Hopcroft:John_E=.html">John E. Hopcroft</a>, <a href="../../indices/a-tree/w/Wong:J=_K=.html">J. K. Wong</a>: Linear Time Algorithm for Isomorphism of Planar Graphs (Preliminary Report). 172-184 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HopcroftW74">BibTeX</a></font> <li><a name="Tarjan74" href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Testing Graph Connectivity. 185-193 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Tarjan74">BibTeX</a></font> <li><a name="Horvath74" href="../../indices/a-tree/h/Horvath:Edward_C=.html">Edward C. Horvath</a>: Efficient Stable Sorting with Minimal Extra Space. 194-215 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Horvath74">BibTeX</a></font> <li><a name="HyafilPV74" href="../../indices/a-tree/h/Hyafil:Laurent.html">Laurent Hyafil</a>, <a href="../../indices/a-tree/p/Prusker:F=.html">F. Prusker</a>, <a href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: An Efficient Algorithm for Computing Optimal Desk Merge Patterns (Extended Abstract). 216-229 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HyafilPV74">BibTeX</a></font> <li><a name="Lipton74" href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>: Limitations of Synchronization Primitives with Conditional Branching and Global Variables. 230-241 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lipton74">BibTeX</a></font> <li><a name="Millen74" href="../../indices/a-tree/m/Millen:Jonathan_K=.html">Jonathan K. Millen</a>: Construction with Parallel Derivatives of the Closure of a Parallel Program Schema. 242-247 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Millen74">BibTeX</a></font> <li><a name="VairavanD74" href="../../indices/a-tree/v/Vairavan:K=.html">K. Vairavan</a>, <a href="../../indices/a-tree/d/DeMillo:Richard_A=.html">Richard A. DeMillo</a>: Parallel Scheduling of Programs in a Restricted Model of Computation. 248-255 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/VairavanD74">BibTeX</a></font> <li><a name="Greibach74" href="../../indices/a-tree/g/Greibach:Sheila_A=.html">Sheila A. Greibach</a>: Some Restrictions on W-Grammars. 256-265 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Greibach74">BibTeX</a></font> <li><a name="Hammer74" href="../../indices/a-tree/h/Hammer:Michael.html">Michael Hammer</a>: A New Grammatical Transformation into LL(k) Form (Extended Abstract). 266-275 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hammer74">BibTeX</a></font> <li><a name="Seiferas74" href="../../indices/a-tree/s/Seiferas:Joel_I=.html">Joel I. Seiferas</a>: Observations on Nondeterministic Multidimensional Iterative Arrays. 276-289 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Seiferas74">BibTeX</a></font> <li><a name="BookNP74" href="../../indices/a-tree/b/Book:Ronald_V=.html">Ronald V. Book</a>, <a href="../../indices/a-tree/n/Nivat:Maurice.html">Maurice Nivat</a>, <a href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>: Intersections of Linear Context-Free Languages and Reversal-Bounded Multipushdown Machines (Extended Abstract). 290-296 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BookNP74">BibTeX</a></font> <li><a name="Rosenberg74" href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>: Managing Storage for Extendible Arrays. 297-302 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rosenberg74">BibTeX</a></font> <li><a name="Leeuwen74" href="../../indices/a-tree/l/Leeuwen:Jan_van.html">Jan van Leeuwen</a>: A Partial Solution to the Reachability-Problem for Vector-Addition Systems. 303-309 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Leeuwen74">BibTeX</a></font> <li><a name="DobkinL74" href="../../indices/a-tree/d/Dobkin:David_P=.html">David P. Dobkin</a>, <a href="../../indices/a-tree/l/Lipton:Richard_J=.html">Richard J. Lipton</a>: On Some Generalizations of Binary Search. 310-316 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/DobkinL74">BibTeX</a></font> <li><a name="Miller74" href="../../indices/a-tree/m/Miller:Webb.html">Webb Miller</a>: Computational Complexity and Numerical Stability. 317-322 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Miller74">BibTeX</a></font> <li><a name="Kung74" href="../../indices/a-tree/k/Kung:H=_T=.html">H. T. Kung</a>: New Algorithms and Lower Bounds for the Parallel Evaluation of Certain Rational Expressions. 323-333 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kung74">BibTeX</a></font> <li><a name="Kedem74" href="../../indices/a-tree/k/Kedem:Zvi_M=.html">Zvi M. Kedem</a>: Combining Dimensionality and Rate of Growth Arguments for Establishing Lower Bounds on the Number of Multiplications. 334-341 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kedem74">BibTeX</a></font> <li><a name="BorodinC74" 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>: On the Number of Additions to Compute Specific Polynomials (Preliminary Version). 342-347 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BorodinC74">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
