Irith Pomeranz, Zvi Kohavi Polynomial Complexity Algorithms for Increasing the Testability of Digital Circuits by Testing Module Insertion. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1991, v:40, n:11, pp:1198-1214 [Journal]
Irith Pomeranz, Zvi Kohavi A limited exponential complexity algorithm for increasing the testability of digital circuits by testing-module insertion. [Citation Graph (0, 0)][DBLP] IEEE Trans. on CAD of Integrated Circuits and Systems, 1992, v:11, n:2, pp:247-259 [Journal]
Search in 0.002secs, Finished in 0.003secs
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