| 1979 | ||
|---|---|---|
| j9 | H. Allen Curtis: Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees. IEEE Trans. Computers 28(7): 521-528 (1979) | |
| 1977 | ||
| j8 | H. Allen Curtis: Adjacency Table Method of Deriving Minimal Sums. IEEE Trans. Computers 26(11): 1136-1141 (1977) | |
| 1976 | ||
| j7 | H. Allen Curtis: Simplified Decomposition of Boolean Functions. IEEE Trans. Computers 25(10): 1033-1044 (1976) | |
| 1963 | ||
| j6 | 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) | |
| j5 | H. Allen Curtis: Generalized Tree Circuit - The Basic Building Block of an Extended Decomposition Theory. J. ACM 10(4): 562-581 (1963) | |
| 1962 | ||
| j4 | H. Allen Curtis: Multiple Reduction of Variable Dependency of Sequential Machines. J. ACM 9(3): 324-344 (1962) | |
| 1961 | ||
| j3 | ||
| 1959 | ||
| j2 | ||
| j1 | ||
Data released under the ODC-BY 1.0 license — See also our legal information page