focs71.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>12. FOCS 1971: East Lansing, Michigan</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>12. <a href="index.html">FOCS</a> 1971: East Lansing, Michigan</h1> 12th Annual Symposium on Foundations of Computer Science, East Lansing, Michigan, October 1971. IEEE Computer Society <ul> <li><a name="Strong71" href="../../indices/a-tree/s/Strong:H=_Raymond.html">H. Raymond Strong</a>: High Level Languages of Maximum Power. 1-4 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Strong71">BibTeX</a></font> <li><a name="ConstableG71" href="../../indices/a-tree/c/Constable:Robert_L=.html">Robert L. Constable</a>, <a href="../../indices/a-tree/g/Gries:David.html">David Gries</a>: On Classes of Program Schemata. 5-19 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ConstableG71">BibTeX</a></font> <li><a name="BrinsfieldM71" href="../../indices/a-tree/b/Brinsfield:Wm=_A=.html">Wm. A. Brinsfield</a>, <a href="../../indices/a-tree/m/Miller:Raymond_E=.html">Raymond E. Miller</a>: On the Composition of Parallel Program Schemata. 20-23 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BrinsfieldM71">BibTeX</a></font> <li><a name="BurkhardK71" href="../../indices/a-tree/b/Burkhard:Walter_A=.html">Walter A. Burkhard</a>, <a href="../../indices/a-tree/k/Kroon:F=_W=.html">F. W. Kroon</a>: Toward a Weakly Invariant Complexity Theory. 24-32 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BurkhardK71">BibTeX</a></font> <li><a name="Abramson71" href="../../indices/a-tree/a/Abramson:Fred_G=.html">Fred G. Abramson</a>: Effective Computation over the Real Numbers. 33-37 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Abramson71">BibTeX</a></font> <li><a name="KaneY71" href="../../indices/a-tree/k/Kane:J=_Richard.html">J. Richard Kane</a>, <a href="../../indices/a-tree/y/Yau:Stephen_S=.html">Stephen S. Yau</a>: On the Design of Easily Testable Sequential Machines. 38-42 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KaneY71">BibTeX</a></font> <li><a name="OsmanW71" href="../../indices/a-tree/o/Osman:Mohamed_Y=.html">Mohamed Y. Osman</a>, <a href="../../indices/a-tree/w/Weiss:C=_Dennis.html">C. Dennis Weiss</a>: Universal Base Functions and Modules for Realizing Arbitrary Switching Functions. 43-59 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/OsmanW71">BibTeX</a></font> <li><a name="FrosiniG71" href="../../indices/a-tree/f/Frosini:Graziano.html">Graziano Frosini</a>, <a href="../../indices/a-tree/g/Gerace:Giovanni_B=.html">Giovanni B. Gerace</a>: Synthesis of Asynchronous Sequential Circuits with Master-Slave Subcircuits. 60-78 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FrosiniG71">BibTeX</a></font> <li><a name="Akers71" href="../../indices/a-tree/a/Akers_Jr=:Sheldon_B=.html">Sheldon B. Akers Jr.</a>: A Rectangular Logic Array. 79-90 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Akers71">BibTeX</a></font> <li><a name="SternT71" href="../../indices/a-tree/s/Stern:D=_A=.html">D. A. Stern</a>, <a href="../../indices/a-tree/t/Torng:Hwa_C=.html">Hwa C. Torng</a>: NAND Cellular Arrays. 91-104 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SternT71">BibTeX</a></font> <li><a name="Sudborough71" href="../../indices/a-tree/s/Sudborough:Ivan_Hal.html">Ivan Hal Sudborough</a>: Computation by Multi-Head Finite Automata. 105-113 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Sudborough71">BibTeX</a></font> <li><a name="Tarjan71" href="../../indices/a-tree/t/Tarjan:Robert_Endre.html">Robert Endre Tarjan</a>: Depth-First Search and Linear Graph Algorithms (Working Paper). 114-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Tarjan71">BibTeX</a></font> <li><a name="HopcroftK71" href="../../indices/a-tree/h/Hopcroft:John_E=.html">John E. Hopcroft</a>, <a href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>: A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs. 122-125 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HopcroftK71">BibTeX</a></font> <li><a name="HeindelH71" href="../../indices/a-tree/h/Heindel:Lee_E=.html">Lee E. Heindel</a>, <a href="../../indices/a-tree/h/Horowitz:Ellis.html">Ellis Horowitz</a>: On Decreasing the Computing Time for Modular Arithmetic. 126-128 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HeindelH71">BibTeX</a></font> <li><a name="FischerM71" href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>, <a href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>: Boolean Matrix Multiplication and Transitive Closure. 129-131 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/FischerM71">BibTeX</a></font> <li><a name="MunroP71" href="../../indices/a-tree/m/Munro:J=_Ian.html">J. Ian Munro</a>, <a href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>: Optimal Algorithms for Parallel Polynomial Evaluation. 132-139 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MunroP71">BibTeX</a></font> <li><a name="PatersonS71" href="../../indices/a-tree/p/Paterson:Mike.html">Mike Paterson</a>, <a href="../../indices/a-tree/s/Stockmeyer:Larry_J=.html">Larry J. Stockmeyer</a>: Bounds on the Evaluation Time for Rational Polynomials. 140-143 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PatersonS71">BibTeX</a></font> <li><a name="Smith71" href="../../indices/a-tree/s/Smith_III:Alvy_Ray.html">Alvy Ray Smith III</a>: Two-Dimensional Formal Languages and Pattern Recognition by Cellular Automata. 144-152 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Smith71">BibTeX</a></font> <li><a name="CohenC71" href="../../indices/a-tree/c/Cohen:Rina_S=.html">Rina S. Cohen</a>, <a href="../../indices/a-tree/c/Culik_II:Karel.html">Karel Culik II</a>: LR-Regular Grammars-An Extension of LR(k) Grammars. 153-165 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CohenC71">BibTeX</a></font> <li><a name="BrzozowskiS71" href="../../indices/a-tree/b/Brzozowski:Janusz_A=.html">Janusz A. Brzozowski</a>, <a href="../../indices/a-tree/s/Simon:Imre.html">Imre Simon</a>: Characterizations of Locally Testable Events. 166-176 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BrzozowskiS71">BibTeX</a></font> <li><a name="CoffmanJ71" href="../../indices/a-tree/c/Coffman_Jr=:Edward_G=.html">Edward G. Coffman Jr.</a>, <a href="../../indices/a-tree/j/Jones:Neil_D=.html">Neil D. Jones</a>: Priority Paging Algorithms and the Extension Problem. 177-181 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CoffmanJ71">BibTeX</a></font> <li><a name="Dertouzos71" href="../../indices/a-tree/d/Dertouzos:Michael_L=.html">Michael L. Dertouzos</a>: Time Bounds on Space Computations. 182-187 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Dertouzos71">BibTeX</a></font> <li><a name="MeyerF71" href="../../indices/a-tree/m/Meyer:Albert_R=.html">Albert R. Meyer</a>, <a href="../../indices/a-tree/f/Fischer:Michael_J=.html">Michael J. Fischer</a>: Economy of Description by Automata, Grammars, and Formal Systems. 188-191 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/MeyerF71">BibTeX</a></font> <li><a name="Wagner71" href="../../indices/a-tree/w/Wagner:Eric_G=.html">Eric G. Wagner</a>: Languages for Defining Sets in Arbitrary Algebras. 192-201 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Wagner71">BibTeX</a></font> <li><a name="Spira71" href="../../indices/a-tree/s/Spira:Philip_M=.html">Philip M. Spira</a>: Complete Linear Proofs of Systems of Linear Inequalities. 202-206 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Spira71">BibTeX</a></font> <li><a name="Liu71" href="../../indices/a-tree/l/Liu:C=_L=.html">C. L. Liu</a>: Analysis of Sorting Algorithms. 207-215 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Liu71">BibTeX</a></font> <li><a name="Reingold71" href="../../indices/a-tree/r/Reingold:Edward_M=.html">Edward M. Reingold</a>: Computing the Maximum and the Median. 216-218 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Reingold71">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:24 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
