stoc72.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1972</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>4. <a href="index.html">STOC</a> 1972</h1> Proceedings of the 4th Annual ACM Symposium on Theory of Computing, May 1-3, 1972, Denver, Colorado, USA. ACM 1972 <ul> <li><a name="ConstableM72" href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>, <a href="../../indices/a-tree/m/Muchnick:Steven_S=.html">Steven S. Muchnick</a>: Subrecursive Program Schemata I & II: I. Undecidable Equivalence Problems; II. Decidable Equivalence Problems. 1-17 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ConstableM72">BibTeX</a></font> <li><a name="WalkerS72" href="../../indices/a-tree/w/Walker:S=_A=.html">S. A. Walker</a>, <a href="../../indices/a-tree/s/Strong:H=_Raymond.html">H. Raymond Strong</a>: Characterization of Flowchartable Recursions (Short Version). 18-34 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/WalkerS72">BibTeX</a></font> <li><a name="Morris72" href="../../indices/a-tree/m/Morris_Jr=:James_H=.html">James H. Morris Jr.</a>: Recursion Schemes with Lists. 35-43 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Morris72">BibTeX</a></font> <li><a name="Plaisted72" href="../../indices/a-tree/p/Plaisted:David_A=.html">David A. Plaisted</a>: Flowchart Schemata with Counters. 44-51 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Plaisted72">BibTeX</a></font> <li><a name="ChandraM72" href="../../indices/a-tree/c/Chandra:Ashok_K=.html">Ashok K. Chandra</a>, <a href="../../indices/a-tree/m/Manna:Zohar.html">Zohar Manna</a>: Program Schemas with Equality. 52-64 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ChandraM72">BibTeX</a></font> <li><a name="GarlandL72" href="../../indices/a-tree/g/Garland:Stephen_J=.html">Stephen J. Garland</a>, <a href="../../indices/a-tree/l/Luckham:David_C=.html">David C. Luckham</a>: On the Equivalence of Schemes. 65-72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GarlandL72">BibTeX</a></font> <li><a name="CookR72" 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>: Time-Bounded Random Access Machines. 73-80 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/CookR72">BibTeX</a></font> <li><a name="WarkentinF72" href="../../indices/a-tree/w/Warkentin:John_C=.html">John C. Warkentin</a>, <a href="../../indices/a-tree/f/Fischer:Patrick_C=.html">Patrick C. Fischer</a>: Predecessor Machines and Regressing Functions. 81-87 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/WarkentinF72">BibTeX</a></font> <li><a name="Fiduccia72" href="../../indices/a-tree/f/Fiduccia:Charles_M=.html">Charles M. Fiduccia</a>: Polynomial Evaluation via the Division Algorithm: The Fast Fourier Transform Revisited. 88-93 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Fiduccia72">BibTeX</a></font> <li><a name="Kirkpatrick72" href="../../indices/a-tree/k/Kirkpatrick:David_G=.html">David G. Kirkpatrick</a>: On the Additions Necessary to Compute Certain Functions. 94-101 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kirkpatrick72">BibTeX</a></font> <li><a name="Kung72" href="../../indices/a-tree/k/Kung:H=_T=.html">H. T. Kung</a>: A Bound on the Multiplication Efficiency of Iteration. 102-107 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Kung72">BibTeX</a></font> <li><a name="Horowitz72" href="../../indices/a-tree/h/Horowitz:Ellis.html">Ellis Horowitz</a>: Algorithms for Rational Function Arithmetic Operations. 108-118 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Horowitz72">BibTeX</a></font> <li><a name="BlumFPRT72" href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>, <a href="../../indices/a-tree/f/Floyd:Robert_W=.html">Robert W. Floyd</a>, <a href="../../indices/a-tree/p/Pratt:Vaughan_R=.html">Vaughan R. Pratt</a>, <a href="../../indices/a-tree/r/Rivest:Ronald_L=.html">Ronald L. Rivest</a>, <a href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Linear Time Bounds for Median Computations. 119-124 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BlumFPRT72">BibTeX</a></font> <li><a name="KarpMR72" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/m/Miller:Raymond_E=.html">Raymond E. Miller</a>, <a href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>: Rapid Identification of Repeated Patterns in Strings, Trees and Arrays. 125-136 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KarpMR72">BibTeX</a></font> <li><a name="NievergeltR72" href="../../indices/a-tree/n/Nievergelt:J=uuml=rg.html">Jürg Nievergelt</a>, <a href="../../indices/a-tree/r/Reingold:Edward_M=.html">Edward M. Reingold</a>: Binary Search Trees of Bounded Balance. 137-142 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/NievergeltR72">BibTeX</a></font> <li><a name="GareyGU72" 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/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Worst-Case Analysis of Memory Allocation Algorithms. 143-150 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GareyGU72">BibTeX</a></font> <li><a name="Savitch72" href="../../indices/a-tree/s/Savitch:Walter_J=.html">Walter J. Savitch</a>: Maze Recognizing Automata (Extended Abstract). 151-156 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Savitch72">BibTeX</a></font> <li><a name="JonesS72" href="../../indices/a-tree/j/Jones:Neil_D=.html">Neil D. Jones</a>, <a href="../../indices/a-tree/s/Selman:Alan_L=.html">Alan L. Selman</a>: Turing Machines and the Spectra of First-Order Formulas with Equality. 157-167 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/JonesS72">BibTeX</a></font> <li><a name="Schnorr72" href="../../indices/a-tree/s/Schnorr:Claus=Peter.html">Claus-Peter Schnorr</a>: The Process Complexity and Effective Random Tests. 168-176 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Schnorr72">BibTeX</a></font> <li><a name="Symes72" href="../../indices/a-tree/s/Symes:D=_M=.html">D. M. Symes</a>: The Computation of Finite Functions. 177-182 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Symes72">BibTeX</a></font> <li><a name="MeyerB72" href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>, <a href="../../indices/a-tree/b/Bagchi:A=.html">A. Bagchi</a>: Program Size and Economy of Descriptions: Preliminary Report. 183-186 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MeyerB72">BibTeX</a></font> <li><a name="Cook72" href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: A Hierarchy for Nondeterministic Time Complexity. 187-192 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cook72">BibTeX</a></font> <li><a name="Hamlet72" href="../../indices/a-tree/h/Hamlet:Richard_G=.html">Richard G. Hamlet</a>: A Patent Problem for Abstract Programming Languages: Machine-Independent Computations. 193-197 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hamlet72">BibTeX</a></font> <li><a name="OgdenR72" href="../../indices/a-tree/o/Ogden:William_F=.html">William F. Ogden</a>, <a href="../../indices/a-tree/r/Rounds:William_C=.html">William C. Rounds</a>: Compositions of n Tree Transducers. 198-206 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/OgdenR72">BibTeX</a></font> <li><a name="Carlyle-GreibachGG72" href="../../indices/a-tree/c/Carlyle=Greibach:Sheila.html">Sheila Carlyle-Greibach</a>, <a href="../../indices/a-tree/g/Ginsburg:Seymour.html">Seymour Ginsburg</a>, <a href="../../indices/a-tree/g/Goldstine:Jonathan.html">Jonathan Goldstine</a>: Uniformly Erasable AFL. 207-213 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Carlyle-GreibachGG72">BibTeX</a></font> <li><a name="LindenmayerR72" href="../../indices/a-tree/l/Lindenmayer:Aristid.html">Aristid Lindenmayer</a>, <a href="../../indices/a-tree/r/Rozenberg:Grzegorz.html">Grzegorz Rozenberg</a>: Developmental Systems and Languages. 214-221 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LindenmayerR72">BibTeX</a></font> <li><a name="Sethi72" href="../../indices/a-tree/s/Sethi:Ravi.html">Ravi Sethi</a>: Validating Register Allocations for Straight Line Programs. 222-237 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Sethi72">BibTeX</a></font> <li><a name="HechtU72" href="../../indices/a-tree/h/Hecht:Matthew_S=.html">Matthew S. Hecht</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Flow Graph Reducibility. 238-250 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HechtU72">BibTeX</a></font> <li><a name="AhoU72" href="../../indices/a-tree/a/Aho:Alfred_V=.html">Alfred V. Aho</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: A Technique for Speeding Up LR(k) Parsers. 251-263 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AhoU72">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
