stoc73.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1973</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>5. <a href="index.html">STOC</a> 1973</h1> Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, USA. ACM 1973 <ul> <li><a name="StockmeyerM73" href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>, <a href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>: Word Problems Requiring Exponential Time: Preliminary Report. 1-9 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/StockmeyerM73">BibTeX</a></font> <li><a name="Hunt73" href="../../indices/a-tree/h/Hunt_III:Harry_B=.html">Harry B. Hunt III</a>: On the Time and Tape Complexity of Languages I. 10-19 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hunt73">BibTeX</a></font> <li><a name="Greibach73" href="../../indices/a-tree/g/Greibach:Sheila_A=.html">Sheila A. Greibach</a>: Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract. 20-28 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Greibach73">BibTeX</a></font> <li><a name="Cook73" href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: An Observation on Time-Storage Trade Off. 29-33 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cook73">BibTeX</a></font> <li><a name="Oppen73" href="../../indices/a-tree/o/Oppen:Derek_C=.html">Derek C. Oppen</a>: Elementary Bounds for Presburger Arithmetic. 34-37 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Oppen73">BibTeX</a></font> <li><a name="Johnson73" href="../../indices/a-tree/j/Johnson:David_S=.html">David S. Johnson</a>: Approximation Algorithms for Combinatorial Problems. 38-49 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Johnson73">BibTeX</a></font> <li><a name="Miller73" href="../../indices/a-tree/m/Miller:Webb.html">Webb Miller</a>: Toward Mechanical Verification of Properties of Roundoff Error Propagation. 50-58 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Miller73">BibTeX</a></font> <li><a name="Wand73" href="../../indices/a-tree/w/Wand:Mitchell.html">Mitchell Wand</a>: An Unusual Application of Program-Proving. 59-66 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Wand73">BibTeX</a></font> <li><a name="FischerS73" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: Fast On-Line Integer Multiplication. 67-72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/FischerS73">BibTeX</a></font> <li><a name="HopcroftM73" href="../../indices/a-tree/h/Hopcroft:John_E=.html">John E. Hopcroft</a>, <a href="../../indices/a-tree/m/Musinski:J=.html">J. Musinski</a>: Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms. 73-87 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HopcroftM73">BibTeX</a></font> <li><a name="BrockettD73" href="../../indices/a-tree/b/Brockett:Roger_W=.html">Roger W. Brockett</a>, <a href="../../indices/a-tree/d/Dobkin:David_P=.html">David P. Dobkin</a>: On the Optimal Evaluation of a Set of Bilinear Forms. 88-95 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BrockettD73">BibTeX</a></font> <li><a name="Tarjan73" href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Testing Flow Graph Reducibility. 96-107 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Tarjan73">BibTeX</a></font> <li><a name="Constable73" href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>: Type Two Computational Complexity. 108-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Constable73">BibTeX</a></font> <li><a name="Ladner73" href="../../indices/a-tree/l/Ladner:Richard_E=.html">Richard E. Ladner</a>: Polynomial Time Reducibility. 122-129 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ladner73">BibTeX</a></font> <li><a name="LynchMF73" href="../../indices/a-tree/l/Lynch:Nancy_A=.html">Nancy A. Lynch</a>, <a href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>, <a href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>: Sets that Don't Help. 130-134 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LynchMF73">BibTeX</a></font> <li><a name="GentlemanJ73" href="../../indices/a-tree/g/Gentleman:W=_Morven.html">W. Morven Gentleman</a>, <a href="../../indices/a-tree/j/Johnson:Stephen_C=.html">Stephen C. Johnson</a>: Analysis of Algorithms, a Case Study: Determinants of Polynomials. 135-141 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GentlemanJ73">BibTeX</a></font> <li><a name="Moenck73" href="../../indices/a-tree/m/Moenck:Robert_T=.html">Robert T. Moenck</a>: Fast Computation of GCDs. 142-151 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Moenck73">BibTeX</a></font> <li><a name="Kung73" href="../../indices/a-tree/k/Kung:H=_T=.html">H. T. Kung</a>: The Computational Complexity of Algebraic Numbers. 152-159 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kung73">BibTeX</a></font> <li><a name="LewisRS73" href="../../indices/a-tree/l/Lewis_II:Philip_M=.html">Philip M. Lewis II</a>, <a href="../../indices/a-tree/r/Rosenkrantz:Daniel_J=.html">Daniel J. Rosenkrantz</a>, <a href="../../indices/a-tree/s/Stearns:Richard_Edwin.html">Richard Edwin Stearns</a>: Attributed Translations. 160-171 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LewisRS73">BibTeX</a></font> <li><a name="Pager73" href="../../indices/a-tree/p/Pager:David.html">David Pager</a>: The Lane Tracing Algorithm for Constructing LR(k) Parsers. 172-181 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pager73">BibTeX</a></font> <li><a name="Sethi73" href="../../indices/a-tree/s/Sethi:Ravi.html">Ravi Sethi</a>: Complete Register Allocation Problems. 182-195 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Sethi73">BibTeX</a></font> <li><a name="Teitelbaum73" href="../../indices/a-tree/t/Teitelbaum:Ray.html">Ray Teitelbaum</a>: Context-Free Error Analysis by Evaluation of Algebraic Power Series. 196-199 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Teitelbaum73">BibTeX</a></font> <li><a name="Baker73" href="../../indices/a-tree/b/Baker:Brenda_S=.html">Brenda S. Baker</a>: Tree Transductions and Families of Tree Languges. 200-206 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Baker73">BibTeX</a></font> <li><a name="WeinerSB73" href="../../indices/a-tree/w/Weiner:Peter.html">Peter Weiner</a>, <a href="../../indices/a-tree/s/Savage:S=_L=.html">S. L. Savage</a>, <a href="../../indices/a-tree/b/Bagchi:A=.html">A. Bagchi</a>: Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient. 207-213 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/WeinerSB73">BibTeX</a></font> <li><a name="Wagner73" href="../../indices/a-tree/w/Wagner:Eric_G=.html">Eric G. Wagner</a>: From Algebras to Programming Languages. 214-223 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Wagner73">BibTeX</a></font> <li><a name="Vuillemin73" href="../../indices/a-tree/v/Vuillemin:Jean.html">Jean Vuillemin</a>: Correct and Optimal Implementations of Recursion in a Simple Programming Language. 224-239 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Vuillemin73">BibTeX</a></font> <li><a name="Kosaraju73" href="../../indices/a-tree/k/Kosaraju:S=_Rao.html">S. Rao Kosaraju</a>: Analysis of Structured Programs. 240-252 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kosaraju73">BibTeX</a></font> <li><a name="AhoHU73" href="../../indices/a-tree/a/Aho:Alfred_V=.html">Alfred V. Aho</a>, <a href="../../indices/a-tree/h/Hopcroft:John_E=.html">John E. Hopcroft</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: On Finding Lowest Common Ancestors in Trees. 253-265 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AhoHU73">BibTeX</a></font> <li><a name="Eilenberg73" href="../../indices/a-tree/e/Eilenberg:Samuel.html">Samuel Eilenberg</a>: Classes of Semigroups and Classes of Sets. 266-267 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Eilenberg73">BibTeX</a></font> <li><a name="Pratt73" href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>: Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues. 268-277 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Pratt73">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
