focs64.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>5. FOCS 1964: City, State</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>5. <a href="index.html">FOCS</a> 1964</h1> 5th Annual Symposium on Foundations of Computer Science, 1964. IEEE Computer Society <ul> <li><a name="Hammel64" href="../../indices/a-tree/h/Hammel:David.html">David Hammel</a>: Ideas on asynchronous feedback networks. 4-11 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hammel64">BibTeX</a></font> <li><a name="Swartwout64" href="../../indices/a-tree/s/Swartwout:Robert_E=.html">Robert E. Swartwout</a>: New techniques for designing speed independent control logic. 12-29 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Swartwout64">BibTeX</a></font> <li><a name="GoldbergS64" href="../../indices/a-tree/g/Goldberg:Jack.html">Jack Goldberg</a>, <a href="../../indices/a-tree/s/Short:Robert_A=.html">Robert A. Short</a>: Antiparallel control logic. 30-43 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GoldbergS64">BibTeX</a></font> <li><a name="Harrison64" href="../../indices/a-tree/h/Harrison:Michael_A=.html">Michael A. Harrison</a>: A census of finite automata (extended summary). 44-46 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Harrison64">BibTeX</a></font> <li><a name="Griffiths64" href="../../indices/a-tree/g/Griffiths:Thomas_V=.html">Thomas V. Griffiths</a>: Turing machine recognizers for general rewriting systems. 47-56 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Griffiths64">BibTeX</a></font> <li><a name="GinsburgS64" href="../../indices/a-tree/g/Ginsburg:Seymour.html">Seymour Ginsburg</a>, <a href="../../indices/a-tree/s/Spanier:Edwin_H=.html">Edwin H. Spanier</a>: Mappings of languages by two-tape devices. 57-67 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GinsburgS64">BibTeX</a></font> <li><a name="Fischer64" href="../../indices/a-tree/f/Fischer:Patrick_C=.html">Patrick C. Fischer</a>: On formalisms for Turing machines. 68-75 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Fischer64">BibTeX</a></font> <li><a name="Rosenberg64" href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>: On n-tape finite state acceptors. 76-81 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rosenberg64">BibTeX</a></font> <li><a name="HartmanisS64" href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>, <a href="../../indices/a-tree/s/Stearns:Richard_Edwin.html">Richard Edwin Stearns</a>: Computational complexity of recursive sequences. 82-90 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HartmanisS64">BibTeX</a></font> <li><a name="Green64" href="../../indices/a-tree/g/Green:Milton_W=.html">Milton W. Green</a>: A lower bound on Rado's sigma function for binary Turing machines. 91-94 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Green64">BibTeX</a></font> <li><a name="Hennie64" href="../../indices/a-tree/h/Hennie:F=_C=.html">F. C. Hennie</a>: Fault detecting experiments for sequential circuits. 95-110 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hennie64">BibTeX</a></font> <li><a name="Eichelberger64" href="../../indices/a-tree/e/Eichelberger:Edward_B=.html">Edward B. Eichelberger</a>: Hazard detection in combinational and sequential switching circuits. 111-120 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Eichelberger64">BibTeX</a></font> <li><a name="PoageM64" href="../../indices/a-tree/p/Poage:J=_F=.html">J. F. Poage</a>, <a href="../../indices/a-tree/m/McCluskey:Edward_J=.html">Edward J. McCluskey</a>: Derivation of optimum test sequences for sequential machines. 121-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/PoageM64">BibTeX</a></font> <li><a name="Elspas64" href="../../indices/a-tree/e/Elspas:Bernard.html">Bernard Elspas</a>: Topological constraints on interconnection-limited logic. 133-137 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Elspas64">BibTeX</a></font> <li><a name="Urbano64" href="../../indices/a-tree/u/Urbano:Rocco_H=.html">Rocco H. Urbano</a>: Some new results on the analysis and reliability of large polyfunctional nets. 138-148 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Urbano64">BibTeX</a></font> <li><a name="HicksB64" href="../../indices/a-tree/h/Hicks:G=_L=.html">G. L. Hicks</a>, <a href="../../indices/a-tree/b/Bernstein:Arthur_J=.html">Arthur J. Bernstein</a>: On the minimum stage realization of switching functions using logic gates with limited fan-in. 149-155 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HicksB64">BibTeX</a></font> <li><a name="Bernstein64" href="../../indices/a-tree/b/Bernstein:Arthur_J=.html">Arthur J. Bernstein</a>: Reducing variable dependency in combinational circuits. 156-164 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Bernstein64">BibTeX</a></font> <li><a name="Akers64" href="../../indices/a-tree/a/Akers_Jr=:Sheldon_B=.html">Sheldon B. Akers Jr.</a>: A diagrammatic approach to multi-level logic synthesis. 165-173 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Akers64">BibTeX</a></font> <li><a name="Gaines64" href="../../indices/a-tree/g/Gaines:R=_Stockton.html">R. Stockton Gaines</a>: Implication techniques for Boolean functions. 174-182 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gaines64">BibTeX</a></font> <li><a name="Gimpel64" href="../../indices/a-tree/g/Gimpel:James_F=.html">James F. Gimpel</a>: A reduction technique for prime implicant tables. 183-191 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gimpel64">BibTeX</a></font> <li><a name="StearnsH64" href="../../indices/a-tree/s/Stearns:Richard_Edwin.html">Richard Edwin Stearns</a>, <a href="../../indices/a-tree/h/Hartmanis:Juris.html">Juris Hartmanis</a>: On the application of pair algebra to automata theory. 192-196 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/StearnsH64">BibTeX</a></font> <li><a name="DavisB64" href="../../indices/a-tree/d/Davis:Wayne_A=.html">Wayne A. Davis</a>, <a href="../../indices/a-tree/b/Brzozowski:Janusz_A=.html">Janusz A. Brzozowski</a>: On the linearity of sequential machines. 197-208 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DavisB64">BibTeX</a></font> <li><a name="Liu64" href="../../indices/a-tree/l/Liu:C=_L=.html">C. L. Liu</a>: Sequential-machine realization using feedback shift registers. 209-227 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Liu64">BibTeX</a></font> <li><a name="EpleyW64" href="../../indices/a-tree/e/Epley:D=_L=.html">D. L. Epley</a>, <a href="../../indices/a-tree/w/Wang:P=_T=.html">P. T. Wang</a>: On state assignments and sequential machine decompositions from S. P. partitions. 228-233 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/EpleyW64">BibTeX</a></font> <li><a name="Bavel64" href="../../indices/a-tree/b/Bavel:Zamir.html">Zamir Bavel</a>: On the total length of an experiment, I. 234-248 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Bavel64">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
