stoc69.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1969</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>1. <a href="index.html">STOC</a> 1969</h1> Proceedings of the 1st Annual ACM Symposium on Theory of Computing, May 5-7, 1969, Marina del Rey, CA, USA. ACM 1969 <ul> <li><a name="PetersR69" href="../../indices/a-tree/p/Peters_Jr=:P=_Stanley.html">P. Stanley Peters Jr.</a>, <a href="../../indices/a-tree/r/Ritchie:Robert_W=.html">Robert W. Ritchie</a>: Context-Sensitive Immediate Constituent Analysis-Context-Free Languages Revisited. 1-8 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/PetersR69">BibTeX</a></font> <li><a name="Rose69" href="../../indices/a-tree/r/Rose:Gene_F=.html">Gene F. Rose</a>: Abstract Families of Processors. 9-14 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rose69">BibTeX</a></font> <li><a name="BookG69" href="../../indices/a-tree/b/Book:Ronald_V=.html">Ronald V. Book</a>, <a href="../../indices/a-tree/g/Greibach:Sheila_A=.html">Sheila A. Greibach</a>: Quasi-Realtime Languages-Extended Abstract. 15-18 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BookG69">BibTeX</a></font> <li><a name="Ullian69" href="../../indices/a-tree/u/Ullian:Joseph_S=.html">Joseph S. Ullian</a>: The Inherent Ambiguity Partial Algorithm Problem for Context Free Languages. 19-20 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ullian69">BibTeX</a></font> <li><a name="Chandler69" href="../../indices/a-tree/c/Chandler:W=_J=.html">W. J. Chandler</a>: Abstract Families of Deterministic Languages. 21-30 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Chandler69">BibTeX</a></font> <li><a name="Ogden69" href="../../indices/a-tree/o/Ogden:William_F=.html">William F. Ogden</a>: Intercalation Theorems for Stack Languages. 31-42 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ogden69">BibTeX</a></font> <li><a name="Blum69" href="../../indices/a-tree/b/Blum:Manuel.html">Manuel Blum</a>: On Effective Procedures for Speeding Up Algorithms. 43-53 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Blum69">BibTeX</a></font> <li><a name="Basu69" href="../../indices/a-tree/b/Basu:Sanat_K=.html">Sanat K. Basu</a>: On Classes of Computable Functions. 55-59 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Basu69">BibTeX</a></font> <li><a name="Loveland69" href="../../indices/a-tree/l/Loveland:Donald_W=.html">Donald W. Loveland</a>: On Minimal-Program Complexity Measures. 61-65 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Loveland69">BibTeX</a></font> <li><a name="Borodin69" href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>: Complexity Classes of Recursive Functions and the Existence of Complexity Gaps. 67-78 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Borodin69">BibTeX</a></font> <li><a name="McCreightM69" href="../../indices/a-tree/m/McCreight:Edward_M=.html">Edward M. McCreight</a>, <a href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>: Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report. 79-88 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/McCreightM69">BibTeX</a></font> <li><a name="Young69" href="../../indices/a-tree/y/Young:Paul_R=.html">Paul R. Young</a>: Speed-Ups by Changing the Order in Which Sets are Enumerated (Preliminary Version). 89-92 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Young69">BibTeX</a></font> <li><a name="AhoU69" 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>: Translations on a Context Free Grammar. 93-112 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AhoU69">BibTeX</a></font> <li><a name="Johansen69" href="../../indices/a-tree/j/Johansen:Peter.html">Peter Johansen</a>: Free Groups and Regular Expressions. 113-128 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Johansen69">BibTeX</a></font> <li><a name="Thatcher69" href="../../indices/a-tree/t/Thatcher:James_W=.html">James W. Thatcher</a>: Transformations and Translations from the Point of View of Generalized Finite Automata Theory. 129-142 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Thatcher69">BibTeX</a></font> <li><a name="Rounds69" href="../../indices/a-tree/r/Rounds:William_C=.html">William C. Rounds</a>: Context-Free Grammars on Trees. 143-148 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rounds69">BibTeX</a></font> <li><a name="HermanI69" href="../../indices/a-tree/h/Herman:Gabor_T=.html">Gabor T. Herman</a>, <a href="../../indices/a-tree/i/Isard:Stephen_D=.html">Stephen D. Isard</a>: Computability over Arbitrary Fields. 149-153 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/HermanI69">BibTeX</a></font> <li><a name="Shepard69" href="../../indices/a-tree/s/Shepard:C=_D=.html">C. D. Shepard</a>: Languages in General Algebras. 155-163 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Shepard69">BibTeX</a></font> <li><a name="RosenkrantzS69" 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>: Properties of Deterministic Top Down Grammars. 165-180 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/RosenkrantzS69">BibTeX</a></font> <li><a name="Fischer69" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>: Some Properties of Precedence Languages. 181-190 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Fischer69">BibTeX</a></font> <li><a name="Korenjak69" href="../../indices/a-tree/k/Korenjak:A=_J=.html">A. J. Korenjak</a>: Efficient LR(1) Processor Construction. 191-200 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Korenjak69">BibTeX</a></font> <li><a name="MannaP69" href="../../indices/a-tree/m/Manna:Zohar.html">Zohar Manna</a>, <a href="../../indices/a-tree/p/Pnueli:Amir.html">Amir Pnueli</a>: Formalization of Properties of Recursively Defined Functions. 201-210 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MannaP69">BibTeX</a></font> <li><a name="Zeiger69" href="../../indices/a-tree/z/Zeiger:H=_Paul.html">H. Paul Zeiger</a>: Formal Models for Some Features of Programming Languages. 211-215 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Zeiger69">BibTeX</a></font> <li><a name="Cook69" href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: Variations on Pushdown Machines (Detailed Abstract). 229-231 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cook69">BibTeX</a></font> <li><a name="Cole69" href="../../indices/a-tree/c/Cole:Stephen_N=.html">Stephen N. Cole</a>: Pushdown Store Machines and Real-Time Computation. 233-245 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cole69">BibTeX</a></font> <li><a name="Savitch69" href="../../indices/a-tree/s/Savitch:Walter_J=.html">Walter J. Savitch</a>: Deterministic Simulation of Non-Deterministic Turing Machines (Detailed Abstract). 247-248 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Savitch69">BibTeX</a></font> <li><a name="Hodes69" href="../../indices/a-tree/h/Hodes:Louis.html">Louis Hodes</a>: The Logical Complexity of Geometric Properties in the Plane. 249-254 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Hodes69">BibTeX</a></font> <li><a name="Avizienis69" href="../../indices/a-tree/a/Avizienis:Algirdas.html">Algirdas Avizienis</a>: On the Problem of Computational Time and Complexity of Arithmetic Functions. 255-258 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Avizienis69">BibTeX</a></font> <li><a name="AmorosoLY69" href="../../indices/a-tree/a/Amoroso:Serafino.html">Serafino Amoroso</a>, <a href="../../indices/a-tree/l/Lieblein:Edward.html">Edward Lieblein</a>, <a href="../../indices/a-tree/y/Yamada:Hisao.html">Hisao Yamada</a>: A Unifying Framework for the Theory of Iterative Arrays of Machines. 259-269 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AmorosoLY69">BibTeX</a></font> <li><a name="Spira69" href="../../indices/a-tree/s/Spira:Philip_M=.html">Philip M. Spira</a>: On the Computation Time of Certain Classes of Boolean Functions. 271-272 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Spira69">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:08 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
