default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID2nd SWCT 1961: Detroit, Michigan, USA
- 2nd Annual Symposium on Switching Circuit Theory and Logical Design, Detroit, Michigan, USA, October 17-20, 1961. IEEE Computer Society 1961
I. Minimization of Boolean Functions
- Alan Cobham, R. Fridshal, J. H. North:
An application of linear programming to the minimization of Boolean functions. 3-9 - Edward J. McCluskey:
Minimal sums for Boolean functions having many unspecified fundamental products. 10-17 - Stanley R. Petrick:
Use of a list processing language in programming simplification procedures. 18-24
II. Threshold Logic Design
- Sheldon B. Akers Jr.:
Threshold logic and two-person, zero-sum games. 27-33 - C. K. Chow:
On the characterization of threshold functions. 34-38 - Saburo Muroga:
Functional forms of majority functions and a necessary and sufficient condition for their realizability. 39-46 - O. B. Stram:
The profile technique for the design of threshold device logic. 47-54 - Robert O. Winder:
More about threshold logic. 55-64
III. Neuron Physiology and Threshold Logics
- Donald Kennedy:
The integrative properties of neurons. 67-69 - H. D. Landahl:
Mathematical models of neurone interaction. 70-76 - D. R. Boyle, Robert S. Ledley:
Multivalued logic devices for simulating threshold neurons. 77-82 - Jack D. Cowan:
Many-valued logics and reliable homeostatic mechanisms. 83-84
IV. Introduction to Speed-independent Circuits
- Raymond E. Miller:
An introduction to speed independent circuit theory. 87-93 - Robert E. Swartwout:
One method for designing speed independent logic for a control. 94-105 - James E. Robertson:
Problems in the physical realization of speed independent circuits. 106-108 - D. B. Gillies:
A flow chart notation for the description of a speed-independent control. 109-110
V. Samuel H. Caldwell Memorial Session
- William L. Kilmer:
Transient behavior in iterative combinatorial switching networks. 114-128 - Calvin C. Elgot, Joseph D. Rutledge:
Operations of finite automata. 129-132 - Dean N. Arden:
Delayed-logic and finite-state machines. 133-151 - J. M. Galey, R. E. Norby, J. Paul Roth:
Techniques for the diagnosis of switching circuit failures. 152-160
VI. Open Problems in Switching Theory
- William H. Kautz:
Some unsolved problems in switching theory. 163-165 - Calvin C. Elgot, Saburo Muroga:
Two problems on threshold functions. 166
VII. Logic Network Synthesis
- Marius Cohn:
Canonical forms of functions in P-valued logics. 169-177 - S. Okada, K. P. Rajappan, K. P. Young:
Boolean two-terminal analysis and synthesis. 178-181 - Richard M. Karp, F. E. McFarlin, J. Paul Roth, J. R. Wilts:
A computer program for the synthesis of combinational switching circuits. 182-194 - William H. Kautz:
Automatic fault detection in combinational switching networks. 195-214
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-09 00:24 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
