Ted Stanion

Guiding SAT Diagnosis with Tree Decompositions

Per Bjesse, James H. Kukula, Robert F. Damiano, 2003, SAT.

An efficient method for generating exhaustive test sets

Carl Sechen, Ted Stanion, Debashis Bhattacharya, 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

Boolean division and factorization using binary decision diagrams

Carl Sechen, Ted Stanion, 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

Carl Sechen, Ted Stanion, 1993, ICCAD.

Quasi-algebraic decompositions of switching functions

Carl Sechen, Ted Stanion, 1995, Proceedings Sixteenth Conference on Advanced Research in VLSI.

TSUNAMI: a path oriented scheme for algebraic test generation

Ted Stanion, Debashis Bhattacharya, D. Bhattacharya, 1991, [1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium.

Implicit verification of structurally dissimilar arithmetic circuits

Ted Stanion, 1999, Proceedings 1999 IEEE International Conference on Computer Design: VLSI in Computers and Processors (Cat. No.99CB37040).

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

Carl Sechen, Ted Stanion, C. Sechen, 1995, 32nd Design Automation Conference.

A practical and efficient method for compare-point matching

Robert F. Damiano, Ted Stanion, Hi-Keung Tony Ma, 2002, DAC '02.

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

Carl Sechen, Ted Stanion, 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).