Conor F. Madigan

Cha : Engineering an e cient SAT solver

Matthew W. Moskewicz, Sharad Malik, Conor F. Madigan, 2001, DAC 2001.

Accelerating Boolean satisfiability through application specific processing

Sharad Malik, Matthew W. Moskewicz, Ying Zhao, 2001, International Symposium on System Synthesis (IEEE Cat. No.01EX526).

Engineering a (super?) efficient sat solver

Matthew W. Moskewicz, Sharad Malik, Conor F. Madigan, 2001, Design Automation Conference.

Chaff: engineering an efficient SAT solver

M. Moskewicz, Lintao Zhang, S. Malik, 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

Efficient conflict driven learning in a Boolean satisfiability solver

Sharad Malik, Matthew W. Moskewicz, Conor F. Madigan, 2001, IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281).

Chaff: engineering an efficient SAT solver

Sharad Malik, Matthew W. Moskewicz, Ying Zhao, 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

Engineering a Highly E cient SAT Solver

Matthew W. Moskewicz, Sharad Malik, Conor F. Madigan, 2001, Design Automation Conference.

Matching architecture to application via configurable processors: a case study with boolean satisfiability problem

Sharad Malik, Matthew W. Moskewicz, Ying Zhao, 2001, Proceedings 2001 IEEE International Conference on Computer Design: VLSI in Computers and Processors. ICCD 2001.