H. Allen Curtis

16 papers Journal 16
YearRankTypeTitle / Venue / Authors
1979 J jnl
Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees.
IEEE Trans. Computers
H. Allen Curtis
1977 J jnl
Adjacency Table Method of Deriving Minimal Sums.
IEEE Trans. Computers
H. Allen Curtis
1976 J jnl
Simplified Decomposition of Boolean Functions.
IEEE Trans. Computers
H. Allen Curtis
1973 J jnl
A New Type Double-Rank Sequential Machine.
IEEE Trans. Computers
H. Allen Curtis
1973 J jnl
Tan-Like State Assignments ror Synchronous Sequential Machines.
IEEE Trans. Computers
H. Allen Curtis
1971 J jnl
The Further Reduction of CC-Tables.
IEEE Trans. Computers
H. Allen Curtis
1971 J jnl
The Realization of Polylinear Sequential Circuits Using Flip-Flop Memory.
IEEE Trans. Computers
H. Allen Curtis
1970 J jnl
Systematic Procedures for Realizing Synchronous Sequential Machines Using Flip-Flop Memory: Part II.
IEEE Trans. Computers
H. Allen Curtis
1969 J jnl
Systematic Procedures for Realizing Synchronous Sequential Machines Using Flip-Flop Memory: Part I.
IEEE Trans. Computers
H. Allen Curtis
1968 J jnl
Polylinear Sequential Circuit Realizations of Finite Automata.
IEEE Trans. Computers
H. Allen Curtis
1963 J jnl
Generalized Tree Circuit - The Basic Building Block of an Extended Decomposition Theory.
J. ACM
H. Allen Curtis
1963 J jnl
Use of Decomposition Theory in the Solution of the State Assignment Problem of Sequential Machines.
J. ACM
H. Allen Curtis
1962 J jnl
Multiple Reduction of Variable Dependency of Sequential Machines.
J. ACM
H. Allen Curtis
1961 J jnl
A Generalized Tree Circuit.
J. ACM
H. Allen Curtis
1959 J jnl
A Functional Canonical Form.
J. ACM
H. Allen Curtis
1959 J jnl
Multifunctional Circuits in Functional Canonical Form.
J. ACM
H. Allen Curtis