focs62.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>3. FOCS 1962: 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>3. <a href="index.html">FOCS</a> 1962</h1> 3rd Annual Symposium on Foundations of Computer Science, October 1962. IEEE Computer Society <ul> <li><a name="Meo62" href="../../indices/a-tree/m/Meo:Angelo_Raffaele.html">Angelo Raffaele Meo</a>: On the minimal third order expression of a Boolean function. 5-24 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Meo62">BibTeX</a></font> <li><a name="SamsonC62" href="../../indices/a-tree/s/Samson:E=_W=.html">E. W. Samson</a>, <a href="../../indices/a-tree/c/Calabi:Lorenzo.html">Lorenzo Calabi</a>: Research and algorithms in the theory of Boolean formulas. 25-32 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/SamsonC62">BibTeX</a></font> <li><a name="CalabiR62" href="../../indices/a-tree/c/Calabi:Lorenzo.html">Lorenzo Calabi</a>, <a href="../../indices/a-tree/r/Riley:J=_A=.html">J. A. Riley</a>: The algebra of Boolean formulas: Some criteria for minimality. 33-47 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CalabiR62">BibTeX</a></font> <li><a name="Lawler62" href="../../indices/a-tree/l/Lawler:Eugene_L=.html">Eugene L. Lawler</a>: Minimal Boolean expressions with more than two levels of sums and products. 49-59 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Lawler62">BibTeX</a></font> <li><a name="ElgotR62" href="../../indices/a-tree/e/Elgot:Calvin_C=.html">Calvin C. Elgot</a>, <a href="../../indices/a-tree/r/Rutledge:Joseph_D=.html">Joseph D. Rutledge</a>: Machine properties preserved under state minimization. 61-70 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ElgotR62">BibTeX</a></font> <li><a name="Hazeltine62" href="../../indices/a-tree/h/Hazeltine:B=.html">B. Hazeltine</a>: A procedure for obtaining an economical asynchronous sequential circuit directly from a set of regular expressions. 71-79 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hazeltine62">BibTeX</a></font> <li><a name="Hohn62" href="../../indices/a-tree/h/Hohn:Franz_E=.html">Franz E. Hohn</a>: States of sequential machines whose logical elements involve delay. 81-89 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Hohn62">BibTeX</a></font> <li><a name="McCluskey62" href="../../indices/a-tree/m/McCluskey:Edward_J=.html">Edward J. McCluskey</a>: Reduction of feedback loops in sequential circuits and carry leads in iterative networks. 91-102 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/McCluskey62">BibTeX</a></font> <li><a name="Levien62" href="../../indices/a-tree/l/Levien:Roger_E=.html">Roger E. Levien</a>: The synthesis of cascade switching circuits. 103-121 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Levien62">BibTeX</a></font> <li><a name="BeattyM62" href="../../indices/a-tree/b/Beatty:J=_C=.html">J. C. Beatty</a>, <a href="../../indices/a-tree/m/Miller:Raymond_E=.html">Raymond E. Miller</a>: Some theorems for incompletely specified sequential machines with applications to state minimization. 123-136 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BeattyM62">BibTeX</a></font> <li><a name="Winograd62" href="../../indices/a-tree/w/Winograd:Shmuel.html">Shmuel Winograd</a>: Bounded-transient automata. 137-141 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Winograd62">BibTeX</a></font> <li><a name="Even62" href="../../indices/a-tree/e/Even:Shimon.html">Shimon Even</a>: Generalized automata and their information losslessness. 143-147 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Even62">BibTeX</a></font> <li><a name="Akers62" href="../../indices/a-tree/a/Akers_Jr=:Sheldon_B=.html">Sheldon B. Akers Jr.</a>: Synthesis of combinational logic using three-input majority gates. 149-157 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Akers62">BibTeX</a></font> <li><a name="LewisC62" href="../../indices/a-tree/l/Lewis_II:Philip_M=.html">Philip M. Lewis II</a>, <a href="../../indices/a-tree/c/Coates:C=_L=.html">C. L. Coates</a>: A realization procedure for threshold gate networks. 159-168 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/LewisC62">BibTeX</a></font> <li><a name="Muroga62" href="../../indices/a-tree/m/Muroga:Saburo.html">Saburo Muroga</a>: Generation of self-dual threshold functions and lower bounds of the number of threshold functions and a maximum weight. 169-184 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Muroga62">BibTeX</a></font> <li><a name="Tung62" href="../../indices/a-tree/t/Tung:Chuen_K=.html">Chuen K. Tung</a>: On some transformation theorems in many-valued logical systems. 185-199 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Tung62">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
