Binary Decision Diagrams

IEEE Transactions on Computers

Volumn C-27, Issue 6, 1978, Pages 509-516

  Akers, Sheldon B ^a  

^a GENERAL ELECTRIC COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LOGIC DEVICES;

COMPUTER METATHEORY;

EID: 0017983865     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1978.1675141     Document Type: Article

References (8)

1. C. Berge, The Theory of Graphs and Its Applications. London: Methuen, 1962.
2. F. Harary, R. Z. Norman, and D. Cartwright, Structural Models: An Introduction to the Theory of Directed Graphs. New York: Wiley, 1966.
3. D. E. Knuth, Fundamental Algorithms, The Art of Computer Programming, Vol. I. Reading, MA: Addison-Wesley, 1969.
4. H. T. Nagle, Jr., B. D. Carroll, and J. D. Irwin, An Introduction to Computer Logic. Englewood Cliffs, NJ: Prentice-Hall, 1975.
5. S. B. Akers, “Universal test sets for logic networks,” IEEE Trans. Comput., vol. C-22, pp. 835–839, Sept. 1973.
6. S. M. Reddy, “Complete test sets for logic functions,” IEEE Trans. Comput., vol. C-22, pp. 1016–1020, Nov. 1973.
7. D. B. Armstrong, “On finding a nearly minimal set of fault detection tests for combinational logic nets,” IEEE Trans. Comput., vol. EC-15, pp. 66-73, Feb. 1966.
8. C. Ghest and J. Springer, Advanced Micro Devices Data Book, Advanced Micro Devices, Inc., pp. 8-9-8-28, 1974.