Search the dblp DataBase

Publications of Author

1. Ted Stanion, Carl Sechen
   Quasi-algebraic decompositions of switching functions. [Citation Graph (0, 0)][DBLP]
   ARVLSI, 1995, pp:358-367 [Conf]
   
2. Demos Anastasakis, Robert F. Damiano, Hi-Keung Tony Ma, Ted Stanion
   A practical and efficient method for compare-point matching. [Citation Graph (0, 0)][DBLP]
   DAC, 2002, pp:305-310 [Conf]
   
3. Ted Stanion, Carl Sechen
   A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis. [Citation Graph (0, 0)][DBLP]
   DAC, 1995, pp:60-64 [Conf]
   
4. Ted Stanion, Debashis Bhattacharya
   TSUNAMI: A Path Oriented Scheme for Algebraic Test Generation. [Citation Graph (0, 0)][DBLP]
   FTCS, 1991, pp:36-43 [Conf]
   
5. Ted Stanion, Carl Sechen
   Maximum projections of don't care conditions in a Boolean network. [Citation Graph (0, 0)][DBLP]
   ICCAD, 1993, pp:674-679 [Conf]
   
6. Ted Stanion
   Implicit Verification of Structurally Dissimilar Arithmetic Circuits. [Citation Graph (0, 0)][DBLP]
   ICCD, 1999, pp:46-50 [Conf]
   
7. Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu
   Guiding SAT Diagnosis with Tree Decompositions. [Citation Graph (0, 0)][DBLP]
   SAT, 2003, pp:315-329 [Conf]
   
8. Ted Stanion, Debashis Bhattacharya, Carl Sechen
   An efficient method for generating exhaustive test sets. [Citation Graph (0, 0)][DBLP]
   IEEE Trans. on CAD of Integrated Circuits and Systems, 1995, v:14, n:12, pp:1516-1525 [Journal]
   
9. Ted Stanion, Carl Sechen
   Boolean division and factorization using binary decision diagrams. [Citation Graph (0, 0)][DBLP]
   IEEE Trans. on CAD of Integrated Circuits and Systems, 1994, v:13, n:9, pp:1179-1184 [Journal]