ScienceGate
Advanced Search
Author Search
Journal Finder
Blog
Sign in / Sign up
ScienceGate
Search
Author Search
Journal Finder
Blog
Sign in / Sign up
2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961)
Mapping Intimacies
◽
10.1109/focs.1961
◽
1961
◽
Keyword(s):
Circuit Theory
◽
Switching Circuit
◽
Annual Symposium
◽
Logical Design
Download Full-text
Related Documents
Cited By
References
1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design
10.1109/swct.1964
◽
1964
◽
Keyword(s):
Circuit Theory
◽
Switching Circuit
◽
Annual Symposium
◽
Logical Design
Download Full-text
Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design (swct 1963)
10.1109/swct.1963
◽
1963
◽
Keyword(s):
Circuit Theory
◽
Switching Circuit
◽
Annual Symposium
◽
Logical Design
Download Full-text
Sixth Annual Symposium on Switching Circuit Theory and Logical Design
IEEE Transactions on Electronic Computers
◽
10.1109/pgec.1966.264320
◽
1966
◽
Vol EC-15
(2)
◽
pp. 274-274
Author(s):
Donald Haring
Keyword(s):
Circuit Theory
◽
Switching Circuit
◽
Annual Symposium
◽
Logical Design
Download Full-text
J. Hartmanis and R. E. Stearns. Computational complexity of recursive sequences. Switching circuit theory and logical design, Proceedings of the Fifth Annual Symposium, Princeton University, Princeton, N.J., November 11–13, 1964, The Institute of Electrical and Electronics Engineers, Inc., New York1964, pp. 82–90.
Journal of Symbolic Logic
◽
10.2307/2271276
◽
1967
◽
Vol 32
(1)
◽
pp. 121-122
Author(s):
Jiří Bečvář
Keyword(s):
Computational Complexity
◽
Circuit Theory
◽
Switching Circuit
◽
Annual Symposium
◽
Princeton University
◽
Recursive Sequences
◽
Logical Design
Download Full-text
P. M. LewisII, R. E. Stearns, and J. Hartmanis. Memory bounds for recognition of context-free and context-sensitive languages. Sixth Annual Symposium on Switching Circuit Theory and Logical Design, University of Michigan, Ann Arbor, Mich., The Institute of Electrical and Electronics Engineers, Inc., New York 1965, pp. 191–202. See Errata, ibid., p. 190.
Journal of Symbolic Logic
◽
10.2307/2272797
◽
1972
◽
Vol 37
(3)
◽
pp. 625-625
Author(s):
Walter J. Savitch
Keyword(s):
New York
◽
Circuit Theory
◽
University Of Michigan
◽
Switching Circuit
◽
Annual Symposium
◽
Context Sensitive
◽
Ann Arbor
◽
Logical Design
◽
Context Free
Download Full-text
E. J. McCluskeyJr., Minimal sums for Boolean functions having many unspecified fundamental products. Switching circuit theory and logical design, Proceedings of the Second Annual Symposium, Detroit, Mich., October 17–20,1961, and papers from the First Annual Symposium, Chicago, III., October 9–14,1960, American Institute of Electrical Engineers, New York1961, pp. 10–17; also Transactions of the American Institute of Electrical Engineers, vol. 81 part 1 (1962), pp. 387–392.
Journal of Symbolic Logic
◽
10.2307/2271685
◽
1967
◽
Vol 32
(2)
◽
pp. 263-264
Author(s):
Thomas H. Mott
Keyword(s):
Boolean Functions
◽
Circuit Theory
◽
American Institute
◽
Switching Circuit
◽
Annual Symposium
◽
Electrical Engineers
◽
Logical Design
◽
October 17
Download Full-text
6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
10.1109/focs.1965
◽
1965
◽
Keyword(s):
Circuit Theory
◽
Switching Circuit
◽
Annual Symposium
◽
Logical Design
Download Full-text
A. Cobham, R. Fridshal, and J. H. North. An application of linear programming to the minimization of Boolean functions. Switching circuit theory and logical design, Proceedings of the Second Annual Symposium, Detroit, Mich., October 17-20, 1961, and Papers from the First Annual Symposium, Chicago, Ill., October 9-14, 1960, American Institute of Electrical Engineers, New York1961, pp. 3–9.
Journal of Symbolic Logic
◽
10.2307/2270151
◽
1965
◽
Vol 30
(2)
◽
pp. 247-247
Author(s):
Thomas H. Mott
Keyword(s):
Linear Programming
◽
Boolean Functions
◽
Circuit Theory
◽
American Institute
◽
Switching Circuit
◽
Annual Symposium
◽
Electrical Engineers
◽
Minimization Of Boolean Functions
◽
Logical Design
◽
October 17
Download Full-text
R. E. Stearns, J. Hartmanis, and P. M. LewisII. Hierarchies of memory limited computations. Sixth Annual Symposium on Switching Circuit Theory and Logical Design, University of Michigan, Ann Arbor, Mich., The Institute of Electrical and Electronics Engineers, Inc., New York 1965, pp. 179–190.
Journal of Symbolic Logic
◽
10.2307/2272796
◽
1972
◽
Vol 37
(3)
◽
pp. 624-625
Author(s):
Walter J. Savitch
Keyword(s):
New York
◽
Circuit Theory
◽
University Of Michigan
◽
Switching Circuit
◽
Annual Symposium
◽
Ann Arbor
◽
Logical Design
Download Full-text
Dean N. Arden. Delayed-logic and finite-state machines. Switching circuit theory and logical design, Proceedings of the Second Annual Symposium, Detroit, Mich., October 17–20, 1961, and papers from the First Annual Symposium, Chicago, III., October 9–14,1960, American Institute of Electrical Engineers, New York1961, pp. 133–151.
Journal of Symbolic Logic
◽
10.2307/2271532
◽
1971
◽
Vol 36
(1)
◽
pp. 151-151
Author(s):
Robert McNaughton
Keyword(s):
Finite State Machines
◽
Circuit Theory
◽
State Machines
◽
American Institute
◽
Switching Circuit
◽
Annual Symposium
◽
Finite State
◽
Electrical Engineers
◽
Logical Design
◽
October 17
Download Full-text
Sign in / Sign up
Close
Export Citation Format
Close
Share Document
Close