Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Maher N. Mneimneh
2000 – 2009
- 2009
[j3]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
[j2]Maher N. Mneimneh, Karem A. Sakallah: Principles of Sequential-Equivalence Verification. IEEE Design & Test of Computers 22(3): 248-257 (2005)
[c8]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- 2004
[c7]Maher N. Mneimneh, Karem A. Sakallah, John Moondanos: Preserving synchronizing sequences of sequential circuits after retiming. ASP-DAC 2004: 579-584
[c6]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
[c5]
[c4]Maher N. Mneimneh, Karem A. Sakallah: Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution. SAT 2003: 411-425- 2002
[c3]Fadi A. Aloul, Maher N. Mneimneh, Karem A. Sakallah: Search-Based SAT Using Zero-Suppressed BDDs. DATE 2002: 1082
[c2]Fadi A. Aloul, Maher N. Mneimneh, Karem A. Sakallah: ZBDD-Based Backtrack Search SAT Solver. IWLS 2002: 131-136- 2001
[c1]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
[j1]Ali El-Hajj, Karim Y. Kabalan, Maher N. Mneimneh, Feras Karablieh: Microprocessor Simulation and Program Assembling Using Spreadsheets. Simulation 75(2): 82-90 (2000)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 20:25 CET by the dblp team



