|
Search the dblp DataBase
Maher N. Mneimneh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Maher N. Mneimneh, Karem A. Sakallah, John Moondanos
Preserving synchronizing sequences of sequential circuits after retiming. [Citation Graph (0, 0)][DBLP] ASP-DAC, 2004, pp:579-584 [Conf]
- Maher N. Mneimneh, Fadi A. Aloul, Chris Weaver, Saugata Chatterjee, Karem A. Sakallah, Todd M. Austin
Scalable Hybrid Verification of Complex Microprocessors. [Citation Graph (0, 0)][DBLP] DAC, 2001, pp:41-46 [Conf]
- Yoonna Oh, Maher N. Mneimneh, Zaher S. Andraus, Karem A. Sakallah, Igor L. Markov
AMUSE: a minimally-unsatisfiable subformula extractor. [Citation Graph (0, 0)][DBLP] DAC, 2004, pp:518-523 [Conf]
- Fadi A. Aloul, Maher N. Mneimneh, Karem A. Sakallah
Search-Based SAT Using Zero-Suppressed BDDs. [Citation Graph (0, 0)][DBLP] DATE, 2002, pp:1082- [Conf]
- Fadi A. Aloul, Maher N. Mneimneh, Karem A. Sakallah
ZBDD-Based Backtrack Search SAT Solver. [Citation Graph (0, 0)][DBLP] IWLS, 2002, pp:131-136 [Conf]
- Maher N. Mneimneh, Karem A. Sakallah
Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution. [Citation Graph (0, 0)][DBLP] SAT, 2003, pp:411-425 [Conf]
- 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. [Citation Graph (0, 0)][DBLP] SAT, 2005, pp:467-474 [Conf]
- Maher N. Mneimneh, Karem A. Sakallah
Principles of Sequential-Equivalence Verification. [Citation Graph (0, 0)][DBLP] IEEE Design & Test of Computers, 2005, v:22, n:3, pp:248-257 [Journal]
A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|