Search the dblp DataBase
H. Allen Curtis: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- H. Allen Curtis
A Functional Canonical Form. [Citation Graph (0, 0)][DBLP]
J. ACM, 1959, v:6, n:2, pp:245-258 [Journal] - H. Allen Curtis
Multifunctional Circuits in Functional Canonical Form. [Citation Graph (0, 0)][DBLP]
J. ACM, 1959, v:6, n:4, pp:538-547 [Journal] - H. Allen Curtis
A Generalized Tree Circuit. [Citation Graph (0, 0)][DBLP]
J. ACM, 1961, v:8, n:4, pp:484-496 [Journal] - H. Allen Curtis
Multiple Reduction of Variable Dependency of Sequential Machines. [Citation Graph (0, 0)][DBLP]
J. ACM, 1962, v:9, n:3, pp:324-344 [Journal] - H. Allen Curtis
Use of Decomposition Theory in the Solution of the State Assignment Problem of Sequential Machines. [Citation Graph (0, 0)][DBLP]
J. ACM, 1963, v:10, n:3, pp:386-411 [Journal] - H. Allen Curtis
Generalized Tree Circuit - The Basic Building Block of an Extended Decomposition Theory. [Citation Graph (0, 0)][DBLP]
J. ACM, 1963, v:10, n:4, pp:562-581 [Journal] - H. Allen Curtis
Simplified Decomposition of Boolean Functions. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1976, v:25, n:10, pp:1033-1044 [Journal] - H. Allen Curtis
Adjacency Table Method of Deriving Minimal Sums. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1977, v:26, n:11, pp:1136-1141 [Journal] - H. Allen Curtis
Short-Cut Method of Deriving Nearly Optimal Arrays of NAND Trees. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1979, v:28, n:7, pp:521-528 [Journal]
Search in 0.029secs, Finished in 0.030secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002