focs61.html
Click here to view the file
or
click here to download the file
File contents
<html><head><title>2. FOCS 1961: 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>2. <a href="index.html">FOCS</a> 1961</h1> 2nd Annual Symposium on Foundations of Computer Science, October 1961. IEEE Computer Society <ul> <li><a name="CobhamFN61" href="../../indices/a-tree/c/Cobham:Alan.html">Alan Cobham</a>, <a href="../../indices/a-tree/f/Fridshal:R=.html">R. Fridshal</a>, <a href="../../indices/a-tree/n/North:J=_H=.html">J. H. North</a>: An application of linear programming to the minimization of Boolean functions. 3-9 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/CobhamFN61">BibTeX</a></font> <li><a name="McCluskey61" href="../../indices/a-tree/m/McCluskey:Edward_J=.html">Edward J. McCluskey</a>: Minimal sums for Boolean functions having many unspecified fundamental products. 10-17 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/McCluskey61">BibTeX</a></font> <li><a name="Petrick61" href="../../indices/a-tree/p/Petrick:Stanley_R=.html">Stanley R. Petrick</a>: Use of a list processing language in programming simplification procedures. 18-24 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Petrick61">BibTeX</a></font> <li><a name="Akers61" href="../../indices/a-tree/a/Akers_Jr=:Sheldon_B=.html">Sheldon B. Akers Jr.</a>: Threshold logic and two-person, zero-sum games. 27-33 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Akers61">BibTeX</a></font> <li><a name="Chow61" href="../../indices/a-tree/c/Chow:C=_K=.html">C. K. Chow</a>: On the characterization of threshold functions. 34-38 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Chow61">BibTeX</a></font> <li><a name="Muroga61" href="../../indices/a-tree/m/Muroga:Saburo.html">Saburo Muroga</a>: Functional forms of majority functions and a necessary and sufficient condition for their realizability. 39-46 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Muroga61">BibTeX</a></font> <li><a name="Stram61" href="../../indices/a-tree/s/Stram:O=_B=.html">O. B. Stram</a>: The profile technique for the design of threshold device logic. 47-54 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Stram61">BibTeX</a></font> <li><a name="Winder61" href="../../indices/a-tree/w/Winder:Robert_O=.html">Robert O. Winder</a>: More about threshold logic. 55-64 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Winder61">BibTeX</a></font> <li><a name="Kennedy61" href="../../indices/a-tree/k/Kennedy:Donald.html">Donald Kennedy</a>: The integrative properties of neurons. 67-69 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kennedy61">BibTeX</a></font> <li><a name="Landahl61" href="../../indices/a-tree/l/Landahl:H=_D=.html">H. D. Landahl</a>: Mathematical models of neurone interaction. 70-76 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Landahl61">BibTeX</a></font> <li><a name="BoyleL61" href="../../indices/a-tree/b/Boyle:D=_R=.html">D. R. Boyle</a>, <a href="../../indices/a-tree/l/Ledley:Robert_S=.html">Robert S. Ledley</a>: Multivalued logic devices for simulating threshold neurons. 77-82 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/BoyleL61">BibTeX</a></font> <li><a name="Cowan61" href="../../indices/a-tree/c/Cowan:Jack_D=.html">Jack D. Cowan</a>: Many-valued logics and reliable homeostatic mechanisms. 83-84 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Cowan61">BibTeX</a></font> <li><a name="Miller61" href="../../indices/a-tree/m/Miller:Raymond_E=.html">Raymond E. Miller</a>: An introduction to speed independent circuit theory. 87-93 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Miller61">BibTeX</a></font> <li><a name="Swartwout61" href="../../indices/a-tree/s/Swartwout:Robert_E=.html">Robert E. Swartwout</a>: One method for designing speed independent logic for a control. 94-105 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Swartwout61">BibTeX</a></font> <li><a name="Robertson61" href="../../indices/a-tree/r/Robertson:James_E=.html">James E. Robertson</a>: Problems in the physical realization of speed independent circuits. 106-108 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Robertson61">BibTeX</a></font> <li><a name="Gillies61" href="../../indices/a-tree/g/Gillies:D=_B=.html">D. B. Gillies</a>: A flow chart notation for the description of a speed-independent control. 109-110 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Gillies61">BibTeX</a></font> <li><a name="Kilmer61" href="../../indices/a-tree/k/Kilmer:William_L=.html">William L. Kilmer</a>: Transient behavior in iterative combinatorial switching networks. 114-128 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Kilmer61">BibTeX</a></font> <li><a name="ElgotR61" 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>: Operations of finite automata. 129-132 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ElgotR61">BibTeX</a></font> <li><a name="Arden61" href="../../indices/a-tree/a/Arden:Dean_N=.html">Dean N. Arden</a>: Delayed-logic and finite-state machines. 133-151 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Arden61">BibTeX</a></font> <li><a name="GaleyNR61" href="../../indices/a-tree/g/Galey:J=_M=.html">J. M. Galey</a>, <a href="../../indices/a-tree/n/Norby:R=_E=.html">R. E. Norby</a>, <a href="../../indices/a-tree/r/Roth:J=_P=.html">J. P. Roth</a>: Techniques for the diagnosis of switching circuit failures. 152-160 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/GaleyNR61">BibTeX</a></font> <li><a name="ElgotM61" href="../../indices/a-tree/e/Elgot:Calvin_C=.html">Calvin C. Elgot</a>, <a href="../../indices/a-tree/m/Muroga:Saburo.html">Saburo Muroga</a>: Two problems on threshold functions. 166 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/ElgotM61">BibTeX</a></font> <li><a name="Cohn61" href="../../indices/a-tree/c/Cohn:M=.html">M. Cohn</a>: Canonical forms of functions in P-valued logics. 169-177 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/Cohn61">BibTeX</a></font> <li><a name="OkadaRY61" href="../../indices/a-tree/o/Okada:S=.html">S. Okada</a>, <a href="../../indices/a-tree/r/Rajappan:K=_P=.html">K. P. Rajappan</a>, <a href="../../indices/a-tree/y/Young:K=_P=.html">K. P. Young</a>: Boolean two-terminal analysis and synthesis. 178-181 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/OkadaRY61">BibTeX</a></font> <li><a name="KarpMRW61" href="../../indices/a-tree/k/Karp:Richard_M=.html">Richard M. Karp</a>, <a href="../../indices/a-tree/m/McFarlin:F=_E=.html">F. E. McFarlin</a>, <a href="../../indices/a-tree/r/Roth:J=_P=.html">J. P. Roth</a>, <a href="../../indices/a-tree/w/Wilts:J=_R=.html">J. R. Wilts</a>: A computer program for the synthesis of combinational switching circuits. 182-194 <font size="-3"><a href="http://dblp.uni-trier.de/rec/bibtex/conf/focs/KarpMRW61">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:22 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
