stoc70.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1970</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>2. <a href="index.html">STOC</a> 1970</h1> Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, May 4-6, 1970, Northampton, Massachusetts, USA. ACM 1970 <ul> <li><a name="Constable70" href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>: On the Size of Programs in Subrecursive Formalisms. 1-9 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Constable70">BibTeX</a></font> <li><a name="Cudia70" href="../../indices/a-tree/c/Cudia:Dennis_F=.html">Dennis F. Cudia</a>: The Degree Hierarchy of Undecidable Problems of Formal Grammars. 10-21 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cudia70">BibTeX</a></font> <li><a name="Lewis70" href="../../indices/a-tree/l/Lewis:Forbes_D=.html">Forbes D. Lewis</a>: Unsolvability Considerations in Computational Complexity. 22-30 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lewis70">BibTeX</a></font> <li><a name="LandweberR70" href="../../indices/a-tree/l/Landweber:Lawrence_H=.html">Lawrence H. Landweber</a>, <a href="../../indices/a-tree/r/Robertson:Edward_L=.html">Edward L. Robertson</a>: Recursive Properties of Abstract Complexity Classes (Preliminary Version). 31-36 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LandweberR70">BibTeX</a></font> <li><a name="BassY70" href="../../indices/a-tree/b/Bass:Leonard_J=.html">Leonard J. Bass</a>, <a href="../../indices/a-tree/y/Young:Paul_R=.html">Paul R. Young</a>: Hierarchies Based on Computational Complexity and Irregularities of Class Determining Measured Sets (Preliminary Report). 37-40 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BassY70">BibTeX</a></font> <li><a name="Ausiello70" href="../../indices/a-tree/a/Ausiello:Giorgio.html">Giorgio Ausiello</a>: On Bounds on the Number of Steps to Compute Functions. 41-47 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ausiello70">BibTeX</a></font> <li><a name="Rosenberg70" href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>: Data Graphs and Addressing Schemes: Extended Abstract. 48-61 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rosenberg70">BibTeX</a></font> <li><a name="Burkhard70" href="../../indices/a-tree/b/Burkhard:Walter_A=.html">Walter A. Burkhard</a>: Complexity Problems in Real Time Computation. 62-69 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Burkhard70">BibTeX</a></font> <li><a name="Cook70" href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: Path Systems and Language Recognition. 70-72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cook70">BibTeX</a></font> <li><a name="Morris70" href="../../indices/a-tree/m/Morris:James_B=.html">James B. Morris</a>: A Result on the Relationship between Simple Precedence Languages and Reducing Transition Languages. 73-80 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Morris70">BibTeX</a></font> <li><a name="Lindstrom70" href="../../indices/a-tree/l/Lindstrom:Gary.html">Gary Lindstrom</a>: The Design of Parsers for Incremental Language Processors. 81-91 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Lindstrom70">BibTeX</a></font> <li><a name="BookGW70" 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>, <a href="../../indices/a-tree/w/Wegbreit:Ben.html">Ben Wegbreit</a>: Tape- and Time-Bounded Turing Acceptors and AFLs: Extended Abstract. 92-99 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/BookGW70">BibTeX</a></font> <li><a name="Rounds70" href="../../indices/a-tree/r/Rounds:William_C=.html">William C. Rounds</a>: Tree-Oriented Proofs of Some Theorems on Context-Free and Indexed Languages. 109-116 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rounds70">BibTeX</a></font> <li><a name="Rosen70" href="../../indices/a-tree/r/Rosen:Barry_K=.html">Barry K. Rosen</a>: Tree-Manipulating Systems and Church-Rosser Theorems. 117-127 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rosen70">BibTeX</a></font> <li><a name="MartinV70" href="../../indices/a-tree/m/Martin:David_F=.html">David F. Martin</a>, <a href="../../indices/a-tree/v/Vere:Steven_A=.html">Steven A. Vere</a>: On Syntax-Directed Transduction and Tree Transducers. 129-135 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/MartinV70">BibTeX</a></font> <li><a name="AhoU70" 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>: Transformations on Straight Line Programs-Preliminary Version. 136-148 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AhoU70">BibTeX</a></font> <li><a name="McGowan70" href="../../indices/a-tree/m/McGowan:Clement_L=.html">Clement L. McGowan</a>: The Correctness of a Modified SECD Machine. 149-157 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/McGowan70">BibTeX</a></font> <li><a name="Manna70" href="../../indices/a-tree/m/Manna:Zohar.html">Zohar Manna</a>: Second-Order Mathematical Theory of Computation. 158-168 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Manna70">BibTeX</a></font> <li><a name="KingF70" href="../../indices/a-tree/k/King:James_C=.html">James C. King</a>, <a href="../../indices/a-tree/f/Floyd:Robert_W=.html">Robert W. Floyd</a>: An Interpretation Oriented Theorem Prover over Integers. 169-179 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/KingF70">BibTeX</a></font> <li><a name="Reiter70" href="../../indices/a-tree/r/Reiter:Raymond.html">Raymond Reiter</a>: The Predicate Elimination Strategy in Theorem Proving. 180-183 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Reiter70">BibTeX</a></font> <li><a name="Strong70" href="../../indices/a-tree/s/Strong_Jr=:H=_R=.html">H. R. Strong Jr.</a>: Translating Recursion Equations into Flow Charts. 184-197 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Strong70">BibTeX</a></font> <li><a name="Ellis70" href="../../indices/a-tree/e/Ellis:Clarence_A=.html">Clarence A. Ellis</a>: Probabilistic Tree Automata. 198-205 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ellis70">BibTeX</a></font> <li><a name="Chang70" href="../../indices/a-tree/c/Chang:Shi=Kuo.html">Shi-Kuo Chang</a>: The Analysis of Two-Dimensional Patterns using Picture Processing Grammars. 206-216 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Chang70">BibTeX</a></font> <li><a name="Perrot70" href="../../indices/a-tree/p/Perrot:Jean=Fran=ccedil=ois.html">Jean-François Perrot</a>: On The Relationship between Finite Automata, Finite Monoids, and Prefix Codes. 217-220 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Perrot70">BibTeX</a></font> <li><a name="Nivat70" href="../../indices/a-tree/n/Nivat:Maurice.html">Maurice Nivat</a>: On Some Families of Languages Related to the Dyck Language. 221-225 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Nivat70">BibTeX</a></font> <li><a name="Ullian70" href="../../indices/a-tree/u/Ullian:Joseph_S=.html">Joseph S. Ullian</a>: Three Theorems on Abstract Families of Languages. 226-230 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Ullian70">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
