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