stoc71.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>STOC 1971</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>3. <a href="index.html">STOC</a> 1971</h1> Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, May 3-5, 1971, Shaker Heights, Ohio, USA. ACM 1971 <ul> <li><a name="Stanat71" href="../../indices/a-tree/s/Stanat:Donald_F=.html">Donald F. Stanat</a>: Formal Languages and Power Series. 1-11 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Stanat71">BibTeX</a></font> <li><a name="Wagner71" href="../../indices/a-tree/w/Wagner:Eric_G=.html">Eric G. Wagner</a>: An Algebraic Theory of Recursive Definitions and Recursive Languages. 12-23 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Wagner71">BibTeX</a></font> <li><a name="Constable71" href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>: Loop Schemata. 24-39 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Constable71">BibTeX</a></font> <li><a name="Munro71" href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>: Some Results Concerning Efficient and Optimal Algorithms. 40-44 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Munro71">BibTeX</a></font> <li><a name="Fiduccia71" href="../../indices/a-tree/f/Fiduccia:Charles_M=.html">Charles M. Fiduccia</a>: Fast Matrix Multiplication. 45-49 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Fiduccia71">BibTeX</a></font> <li><a name="Meyers71" href="../../indices/a-tree/m/Meyers:W=_J=.html">W. J. Meyers</a>: Linear Representation of Tree Structure: A Mathematical Theory of Parenthesis-Free Notations. 50-62 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Meyers71">BibTeX</a></font> <li><a name="Buttelmann71" href="../../indices/a-tree/b/Buttelmann:H=_W=.html">H. W. Buttelmann</a>: On Generalized Finite Automata and Unrestricted Generative Grammars. 63-77 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Buttelmann71">BibTeX</a></font> <li><a name="LevyJ71" href="../../indices/a-tree/l/Levy:Leon_S=.html">Leon S. Levy</a>, <a href="../../indices/a-tree/j/Joshi:Aravind_K=.html">Aravind K. Joshi</a>: Some Results in Tree Automata. 78-85 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/LevyJ71">BibTeX</a></font> <li><a name="Berry71" href="../../indices/a-tree/b/Berry:Daniel_M=.html">Daniel M. Berry</a>: Block Structure: Retention or Deletion? (Extended Abstract). 86-100 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Berry71">BibTeX</a></font> <li><a name="Chang71" href="../../indices/a-tree/c/Chang:Shi=Kuo.html">Shi-Kuo Chang</a>: On the Parallel Computation of Local Operations. 101-115 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Chang71">BibTeX</a></font> <li><a name="Boasson71" href="../../indices/a-tree/b/Boasson:Luc.html">Luc Boasson</a>: An Iteration Theorem for One-Counter Languages. 116-120 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Boasson71">BibTeX</a></font> <li><a name="GinsburgG71" href="../../indices/a-tree/g/Ginsburg:Seymour.html">Seymour Ginsburg</a>, <a href="../../indices/a-tree/g/Goldstine:Jonathan.html">Jonathan Goldstine</a>: Intersection-Closed full AFL and the Recursively Enumerable Languages. 121-131 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/GinsburgG71">BibTeX</a></font> <li><a name="Rajlich71" href="../../indices/a-tree/r/Rajlich:Vaclav.html">Vaclav Rajlich</a>: Absolutely Parallel Grammars and Two-Way Deterministic Finite-State Transducers. 132-137 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rajlich71">BibTeX</a></font> <li><a name="Rosenberg71" href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>: Addressable Data Graphs: Extended Abstract. 138-150 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Rosenberg71">BibTeX</a></font> <li><a name="Cook71" href="../../indices/a-tree/c/Cook:Stephen_A=.html">Stephen A. Cook</a>: The Complexity of Theorem-Proving Procedures. 151-158 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Cook71">BibTeX</a></font> <li><a name="AhoU71" 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>: The Care and Feeding of LR(k) Grammars. 159-170 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/AhoU71">BibTeX</a></font> <li><a name="Wise71" href="../../indices/a-tree/w/Wise:David_S=.html">David S. Wise</a>: Domolki's Algorithm Applied to Generalized Overlap Resolvable Grammars. 171-184 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Wise71">BibTeX</a></font> <li><a name="Terrine71" href="../../indices/a-tree/t/Terrine:G=eacute=rrine.html">Gérrine Terrine</a>: An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars. 185-205 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Terrine71">BibTeX</a></font> <li><a name="McNaughton71" href="../../indices/a-tree/m/McNaughton:Robert.html">Robert McNaughton</a>: A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets. 206-218 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/McNaughton71">BibTeX</a></font> <li><a name="Santos71" href="../../indices/a-tree/s/Santos:Eugene_S=.html">Eugene S. Santos</a>: Algebraic Structure Theory of Stochastic Machines. 219-243 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Santos71">BibTeX</a></font> <li><a name="ConstableH71" href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>, <a href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>: Complexity of Formal Translations and Speed-Up Results. 244-250 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/ConstableH71">BibTeX</a></font> <li><a name="Machtey71" href="../../indices/a-tree/m/Machtey:Michael.html">Michael Machtey</a>: Classification of Computable Functions by Primitive Recursive Classes. 251-257 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Machtey71">BibTeX</a></font> <li><a name="Robertson71" href="../../indices/a-tree/r/Robertson:Edward_L=.html">Edward L. Robertson</a>: Complexity Classes of Partial Recursive Functions (Preliminary Version). 258-266 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/stoc/Robertson71">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
