| 1979 |
|---|
| 9 | | H. Allen Curtis:
Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees.
IEEE Trans. Computers 28(7): 521-528 (1979) |
| 1977 |
|---|
| 8 | | H. Allen Curtis:
Adjacency Table Method of Deriving Minimal Sums.
IEEE Trans. Computers 26(11): 1136-1141 (1977) |
| 1976 |
|---|
| 7 | | H. Allen Curtis:
Simplified Decomposition of Boolean Functions.
IEEE Trans. Computers 25(10): 1033-1044 (1976) |
| 1963 |
|---|
| 6 | EE | H. Allen Curtis:
Use of Decomposition Theory in the Solution of the State Assignment Problem of Sequential Machines.
J. ACM 10(3): 386-411 (1963) |
| 5 | EE | H. Allen Curtis:
Generalized Tree Circuit - The Basic Building Block of an Extended Decomposition Theory.
J. ACM 10(4): 562-581 (1963) |
| 1962 |
|---|
| 4 | EE | H. Allen Curtis:
Multiple Reduction of Variable Dependency of Sequential Machines.
J. ACM 9(3): 324-344 (1962) |
| 1961 |
|---|
| 3 | EE | H. Allen Curtis:
A Generalized Tree Circuit.
J. ACM 8(4): 484-496 (1961) |
| 1959 |
|---|
| 2 | EE | H. Allen Curtis:
A Functional Canonical Form.
J. ACM 6(2): 245-258 (1959) |
| 1 | EE | H. Allen Curtis:
Multifunctional Circuits in Functional Canonical Form.
J. ACM 6(4): 538-547 (1959) |
