Ted Stanion

According to our database, Ted Stanion authored at least 9 papers between 1991 and 2003.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2003

Guiding SAT Diagnosis with Tree Decompositions.

Per Bjesse, James H. Kukula, Robert F. Damiano, Ted Stanion, Yunshan Zhu

Proceedings of the Theory and Applications of Satisfiability Testing, 2003

2002

A practical and efficient method for compare-point matching.

Demos Anastasakis, Robert F. Damiano, Hi-Keung Tony Ma, Ted Stanion

Proceedings of the 39th Design Automation Conference, 2002

1999

Implicit Verification of Structurally Dissimilar Arithmetic Circuits.

Ted Stanion

Proceedings of the IEEE International Conference On Computer Design, 1999

1995

An efficient method for generating exhaustive test sets.

Ted Stanion, Debashis Bhattacharya, Carl Sechen

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1995

A Method for Finding Good Ashenhurst Decompositions and Its Application to FPGA Synthesis.

Ted Stanion, Carl Sechen

Proceedings of the 32st Conference on Design Automation, 1995

Quasi-algebraic decompositions of switching functions.

Ted Stanion, Carl Sechen

Proceedings of the 16th Conference on Advanced Research in VLSI (ARVLSI '95), 1995

1994

Boolean division and factorization using binary decision diagrams.

Ted Stanion, Carl Sechen

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994

1993

Maximum projections of don't care conditions in a Boolean network.

Ted Stanion, Carl Sechen

Proceedings of the 1993 IEEE/ACM International Conference on Computer-Aided Design, 1993

1991

TSUNAMI: A Path Oriented Scheme for Algebraic Test Generation.

Ted Stanion, Debashis Bhattacharya

Proceedings of the 1991 International Symposium on Fault-Tolerant Computing, 1991