 | 2009 |
|---|
| 10 |       | Mark H. Liffiton,
Maher N. Mneimneh,
Inês Lynce,
Zaher S. Andraus,
João Marques-Silva,
Karem A. Sakallah:
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas.
Constraints 14(4): 415-442 (2009) |
| 2005 |
|---|
| 9 | | Maher N. Mneimneh,
Inês Lynce,
Zaher S. Andraus,
João P. Marques Silva,
Karem A. Sakallah:
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas.
SAT 2005: 467-474 |
| 8 | | Maher N. Mneimneh,
Karem A. Sakallah:
Principles of Sequential-Equivalence Verification.
IEEE Design & Test of Computers 22(3): 248-257 (2005) |
| 2004 |
|---|
| 7 | | Maher N. Mneimneh,
Karem A. Sakallah,
John Moondanos:
Preserving synchronizing sequences of sequential circuits after retiming.
ASP-DAC 2004: 579-584 |
| 6 | | Yoonna Oh,
Maher N. Mneimneh,
Zaher S. Andraus,
Karem A. Sakallah,
Igor L. Markov:
AMUSE: a minimally-unsatisfiable subformula extractor.
DAC 2004: 518-523 |
| 2003 |
|---|
| 5 | | Maher N. Mneimneh,
Karem A. Sakallah:
Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution.
SAT 2003: 411-425 |
| 2002 |
|---|
| 4 | | Fadi A. Aloul,
Maher N. Mneimneh,
Karem A. Sakallah:
Search-Based SAT Using Zero-Suppressed BDDs.
DATE 2002: 1082 |
| 3 |  | Fadi A. Aloul,
Maher N. Mneimneh,
Karem A. Sakallah:
ZBDD-Based Backtrack Search SAT Solver.
IWLS 2002: 131-136 |
| 2001 |
|---|
| 2 | | Maher N. Mneimneh,
Fadi A. Aloul,
Christopher T. Weaver,
Saugata Chatterjee,
Karem A. Sakallah,
Todd M. Austin:
Scalable Hybrid Verification of Complex Microprocessors.
DAC 2001: 41-46 |
| 2000 |
|---|
| 1 | | Ali El-Hajj,
Karim Y. Kabalan,
Maher N. Mneimneh,
Feras Karablieh:
Microprocessor Simulation and Program Assembling Using Spreadsheets.
Simulation 75(2): 82-90 (2000) |
