focs70.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>11. FOCS 1970: Santa Monica, California</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>11. <a href="index.html">FOCS</a> 1970: Santa Monica, California</h1> 11th Annual Symposium on Foundations of Computer Science, Santa Monica, California, October 1970. IEEE Computer Society <ul> <li><a name="Rutledge70" href="../../indices/a-tree/r/Rutledge:Joseph_D=.html">Joseph D. Rutledge</a>: Program Schemata as Automata: Part I. 7-24 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rutledge70">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>: Equivalence of Programs with Structured Variables. 25-31 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/AhoU70">BibTeX</a></font> <li><a name="Keller70" href="../../indices/a-tree/k/Keller:Robert_M=.html">Robert M. Keller</a>: On Maximally Parallel Schemata. 32-50 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Keller70">BibTeX</a></font> <li><a name="GaleK70" href="../../indices/a-tree/g/Gale:David.html">David Gale</a>, <a href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>: A Phenomenon in the Theory of Sorting. 51-59 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GaleK70">BibTeX</a></font> <li><a name="ConstableB70" href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>, <a href="../../indices/a-tree/b/Borodin:Allan.html">Allan Borodin</a>: On the Efficiency of Programs in Subrecursive Formalisms (Incomplete Version, Extended Abstract). 60-67 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ConstableB70">BibTeX</a></font> <li><a name="Reingold70" href="../../indices/a-tree/r/Reingold:Edward_M=.html">Edward M. Reingold</a>: On the Optimality of Some Set and Vector Algorithms. 68-71 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Reingold70">BibTeX</a></font> <li><a name="Kameda70" href="../../indices/a-tree/k/Kameda:Tiko.html">Tiko Kameda</a>: On the Computational Power of Some Machines with Pushdown-Like Storage. 72 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kameda70">BibTeX</a></font> <li><a name="Paterson70" href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>: Tape-Bounds for Time-Bounded Turing Machines. 73-75 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Paterson70">BibTeX</a></font> <li><a name="Zalcstein70" href="../../indices/a-tree/z/Zalcstein:Yechezkel.html">Yechezkel Zalcstein</a>: On Star-Free Events. 76-80 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Zalcstein70">BibTeX</a></font> <li><a name="Fliess70" href="../../indices/a-tree/f/Fliess:Michel.html">Michel Fliess</a>: Deux applications de la representation matricielle d'une serie rationnelle non commutative. 81-87 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Fliess70">BibTeX</a></font> <li><a name="Ashkinazy70" href="../../indices/a-tree/a/Ashkinazy:Aaron.html">Aaron Ashkinazy</a>: Fault Detection Experiments for Asynchronous Sequential Machines. 88-96 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ashkinazy70">BibTeX</a></font> <li><a name="FischlerT70" href="../../indices/a-tree/f/Fischler:Martin_A=.html">Martin A. Fischler</a>, <a href="../../indices/a-tree/t/Tannenbaum:Meyer.html">Meyer Tannenbaum</a>: Synchronizing and Representation Problems for Sequential Machines with Masked Outputs. 97-103 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FischlerT70">BibTeX</a></font> <li><a name="BredesonH70" href="../../indices/a-tree/b/Bredeson:Jon_G=.html">Jon G. Bredeson</a>, <a href="../../indices/a-tree/h/Hulina:Paul_T=.html">Paul T. Hulina</a>: Elimination of Static and Dynamic Hazards in Combinatorial Switching Circuits. 104-108 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BredesonH70">BibTeX</a></font> <li><a name="Mago70" href="../../indices/a-tree/m/Mag=oacute=:Gyula.html">Gyula Magó</a>: Asynchronous Sequential Circuits with (2,1) Type State Assignments. 109-113 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Mago70">BibTeX</a></font> <li><a name="Unger70" href="../../indices/a-tree/u/Unger:Stephen_H=.html">Stephen H. Unger</a>: Asynchronous Sequential Switching Circuits with Unrestricted Input Changes. 114-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Unger70">BibTeX</a></font> <li><a name="Bjorner70" href="../../indices/a-tree/b/Bj=oslash=rner:Dines.html">Dines Bjørner</a>: The Synthesis of Finite State Syntax Directed Top-Down and Bottom-Up Transducers. 122-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Bjorner70">BibTeX</a></font> <li><a name="Benson70" href="../../indices/a-tree/b/Benson:David_B=.html">David B. Benson</a>: Syntactic Clues. 133-138 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Benson70">BibTeX</a></font> <li><a name="RosenkrantzL70" href="../../indices/a-tree/r/Rosenkrantz:Daniel_J=.html">Daniel J. Rosenkrantz</a>, <a href="../../indices/a-tree/l/Lewis_II:Philip_M=.html">Philip M. Lewis II</a>: Deterministic Left Corner Parsing (Extended Abstract). 139-152 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RosenkrantzL70">BibTeX</a></font> <li><a name="BirmanU70" href="../../indices/a-tree/b/Birman:Alexander.html">Alexander Birman</a>, <a href="../../indices/a-tree/u/Ullman:Jeffrey_D=.html">Jeffrey D. Ullman</a>: Parsing Algorithms with Backtrack. 153-174 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BirmanU70">BibTeX</a></font> <li><a name="Graham70" href="../../indices/a-tree/g/Graham:Susan_L=.html">Susan L. Graham</a>: Extended Precedence Languages, Bounded Right Context Languages, and Deterministic Languages (Extended Abstract). 175-180 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Graham70">BibTeX</a></font> <li><a name="Giuliano70" href="../../indices/a-tree/g/Giuliano:Joseph_Alphonso.html">Joseph Alphonso Giuliano</a>: Writing Stack Acceptors. 181-193 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Giuliano70">BibTeX</a></font> <li><a name="Banks70" href="../../indices/a-tree/b/Banks:Edwin_Roger.html">Edwin Roger Banks</a>: Universality in Cellular Automata. 194-215 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Banks70">BibTeX</a></font> <li><a name="Smith70" href="../../indices/a-tree/s/Smith_III:Alvy_Ray.html">Alvy Ray Smith III</a>: Cellular Automata and Formal Languages. 216-224 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Smith70">BibTeX</a></font> <li><a name="ShoshaniC70" href="../../indices/a-tree/s/Shoshani:Arie.html">Arie Shoshani</a>, <a href="../../indices/a-tree/c/Coffman_Jr=:Edward_G=.html">Edward G. Coffman Jr.</a>: Sequencing Tasks in Multiprocess Systems to Avoid Deadlocks. 225-235 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ShoshaniC70">BibTeX</a></font> <li><a name="Zeigler70" href="../../indices/a-tree/z/Zeigler:Bernard_P=.html">Bernard P. Zeigler</a>: Series-Parallel Irreducibility: Machine Oriented Definitions and Proofs. 236-239 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Zeigler70">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:12:23 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
