focs65.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>6. FOCS 1965: 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>6. <a href="index.html">FOCS</a> 1965</h1> 6th Annual Symposium on Foundations of Computer Science, 1965. IEEE Computer Society <ul> <li><a name="Stabler65" href="../../indices/a-tree/s/Stabler:E=_P=.html">E. P. Stabler</a>: Threshold gate network synthesis. 5-11 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Stabler65">BibTeX</a></font> <li><a name="CoatesS65" href="../../indices/a-tree/c/Coates:C=_L=.html">C. L. Coates</a>, <a href="../../indices/a-tree/s/Supornpaibul:Vatana.html">Vatana Supornpaibul</a>: On maximum stability realizations of linearly separable Boolean functions. 12-24 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CoatesS65">BibTeX</a></font> <li><a name="GustafsonHSW65" href="../../indices/a-tree/g/Gustafson:Charles_H=.html">Charles H. Gustafson</a>, <a href="../../indices/a-tree/h/Haring:Donald_R=.html">Donald R. Haring</a>, <a href="../../indices/a-tree/s/Susskind:Alfred_K=.html">Alfred K. Susskind</a>, <a href="../../indices/a-tree/w/Wills=Sanford:Thomas_G=.html">Thomas G. Wills-Sanford</a>: Synthesis of counters with threshold elements. 25-35 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GustafsonHSW65">BibTeX</a></font> <li><a name="Hu65" href="../../indices/a-tree/h/Hu:Sze=Tsen.html">Sze-Tsen Hu</a>: Minimal linear decompositions of switching functions. 36-40 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hu65">BibTeX</a></font> <li><a name="GonzalezL65" href="../../indices/a-tree/g/Gonzalez:R=.html">R. Gonzalez</a>, <a href="../../indices/a-tree/l/Lawler:Eugene_L=.html">Eugene L. Lawler</a>: Two-level threshold minimization. 41-44 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GonzalezL65">BibTeX</a></font> <li><a name="Zeiger65" href="../../indices/a-tree/z/Zeiger:H=_Paul.html">H. Paul Zeiger</a>: Cascade synthesis of finite-state machines. 45-51 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Zeiger65">BibTeX</a></font> <li><a name="KohaviS65" href="../../indices/a-tree/k/Kohavi:Zvi.html">Zvi Kohavi</a>, <a href="../../indices/a-tree/s/Smith:Edward_J=.html">Edward J. Smith</a>: Decomposition of sequential machines. 52-61 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KohaviS65">BibTeX</a></font> <li><a name="Nichols65" href="../../indices/a-tree/n/Nichols_III:A=_J=.html">A. J. Nichols III</a>: Modular synthesis of sequential machines. 62-70 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Nichols65">BibTeX</a></font> <li><a name="Davis65" href="../../indices/a-tree/d/Davis:Wayne_A=.html">Wayne A. Davis</a>: On shift register realizations for sequential machines. 71-83 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Davis65">BibTeX</a></font> <li><a name="Brzozowski65" href="../../indices/a-tree/b/Brzozowski:Janusz_A=.html">Janusz A. Brzozowski</a>: On single-loop realizations of automata. 84-93 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Brzozowski65">BibTeX</a></font> <li><a name="Friedman65" href="../../indices/a-tree/f/Friedman:Arthur_D=.html">Arthur D. Friedman</a>: Feedback in asynchronous sequential circuits. 94-104 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Friedman65">BibTeX</a></font> <li><a name="Gimpel65" href="../../indices/a-tree/g/Gimpel:James_F=.html">James F. Gimpel</a>: The synthesis of TANT networks. 105-125 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gimpel65">BibTeX</a></font> <li><a name="DunningK65" href="../../indices/a-tree/d/Dunning:Marion.html">Marion Dunning</a>, <a href="../../indices/a-tree/k/Kolman:Bernard.html">Bernard Kolman</a>: Reliability and fault-masking in n-variable NOR trees. 126-142 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/DunningK65">BibTeX</a></font> <li><a name="Ramamoorthy65" href="../../indices/a-tree/r/Ramamoorthy:C=_V=.html">C. V. Ramamoorthy</a>: Procedures for minimization of ``exclusive-OR'' and ``logical-equivalence'' switching circuits. 143-149 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Ramamoorthy65">BibTeX</a></font> <li><a name="LoomisM65" href="../../indices/a-tree/l/Loomis_Jr=:H=_H=.html">H. H. Loomis Jr.</a>, <a href="../../indices/a-tree/m/McCoy:M=_R=.html">M. R. McCoy</a>: A theory of high-speed clocked logic. 150-161 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LoomisM65">BibTeX</a></font> <li><a name="Veitch65" href="../../indices/a-tree/v/Veitch:Edward_W=.html">Edward W. Veitch</a>: A proof concerning infinite nets of logic elements without feedback. 162-167 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Veitch65">BibTeX</a></font> <li><a name="Hennie65" href="../../indices/a-tree/h/Hennie:F=_C=.html">F. C. Hennie</a>: Crossing sequences and off-line Turing machine computations. 168-172 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hennie65">BibTeX</a></font> <li><a name="RubyF65" href="../../indices/a-tree/r/Ruby:S=_S=.html">S. S. Ruby</a>, <a href="../../indices/a-tree/f/Fischer:Patrick_C=.html">Patrick C. Fischer</a>: Translational methods and computational complexity. 173-178 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/RubyF65">BibTeX</a></font> <li><a name="StearnsHL65" 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>, <a href="../../indices/a-tree/l/Lewis_II:Philip_M=.html">Philip M. Lewis II</a>: Hierarchies of memory limited computations. 179-190 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/StearnsHL65">BibTeX</a></font> <li><a name="LewisSH65" href="../../indices/a-tree/l/Lewis_II:Philip_M=.html">Philip M. Lewis II</a>, <a 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>: Memory bounds for recognition of context-free and context-sensitive languages. 191-202 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LewisSH65">BibTeX</a></font> <li><a name="GinsburgG65" href="../../indices/a-tree/g/Ginsburg:Seymour.html">Seymour Ginsburg</a>, <a href="../../indices/a-tree/g/Greibach:Sheila_A=.html">Sheila A. Greibach</a>: Deterministic context free languages. 203-220 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GinsburgG65">BibTeX</a></font> <li><a name="Rosenberg65" href="../../indices/a-tree/r/Rosenberg:Arnold_L=.html">Arnold L. Rosenberg</a>: On multi-head finite automata. 221-228 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Rosenberg65">BibTeX</a></font> <li><a name="Nievergelt65" href="../../indices/a-tree/n/Nievergelt:J=uuml=rg.html">Jürg Nievergelt</a>: Partially ordered classes of finite automata. 229-234 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Nievergelt65">BibTeX</a></font> <li><a name="Giveon65" href="../../indices/a-tree/g/Give=on:Yehoshafat.html">Yehoshafat Give'on</a>: Transparent categories and categories of transition systems. 235-241 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Giveon65">BibTeX</a></font> <li><a name="BavelM65" href="../../indices/a-tree/b/Bavel:Zamir.html">Zamir Bavel</a>, <a href="../../indices/a-tree/m/Muller:David_E=.html">David E. Muller</a>: Reversibility in monadic algebras and automata. 242-247 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BavelM65">BibTeX</a></font> <li><a name="Wagner65" href="../../indices/a-tree/w/Wagner:Eric_G=.html">Eric G. Wagner</a>: On connecting modules together uniformly to form a modular computer. 248-257 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Wagner65">BibTeX</a></font> <li><a name="Carlyle65" href="../../indices/a-tree/c/Carlyle:Jack_W=.html">Jack W. Carlyle</a>: State-calculable stochastic sequential machines, equivalences, and events. 258-263 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Carlyle65">BibTeX</a></font> <li><a name="TerrisM65" href="../../indices/a-tree/t/Terris:I=.html">I. Terris</a>, <a href="../../indices/a-tree/m/Melkanoff:Michel_A=.html">Michel A. Melkanoff</a>: Investigation and simulation of a self-repairing digital computer. 264-278 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/TerrisM65">BibTeX</a></font> <li><a name="BuckinghamCCN65" href="../../indices/a-tree/b/Buckingham:B=_R=_S=.html">B. R. S. Buckingham</a>, <a href="../../indices/a-tree/c/Carter:William_C=.html">William C. Carter</a>, <a href="../../indices/a-tree/c/Crawford:W=_R=.html">W. R. Crawford</a>, <a href="../../indices/a-tree/n/Nowell:G=_A=.html">G. A. Nowell</a>: The controls automation system. 279-288 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BuckinghamCCN65">BibTeX</a></font> <li><a name="HacklS65" href="../../indices/a-tree/h/Hackl:F=_J=.html">F. J. Hackl</a>, <a href="../../indices/a-tree/s/Shirk:R=_W=.html">R. W. Shirk</a>: An integrated approach to automated computer maintenance. 289-302 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/HacklS65">BibTeX</a></font> <li><a name="Warfield65" href="../../indices/a-tree/w/Warfield:John_N=.html">John N. Warfield</a>: Synthesis of switching circuits to yield prescribed probability relations. 303-309 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Warfield65">BibTeX</a></font> <li><a name="Snapp65" href="../../indices/a-tree/s/Snapp:Parker_W=.html">Parker W. Snapp</a>: Holiac-A family of student-constructed logic teaching aids. 310-326 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Snapp65">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
