BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × France
1 × Italy
1 × United Kingdom
2 × USA
Collaborated with:
K.A.Sakallah F.A.Aloul Z.S.Andraus I.Lynce J.P.M.Silva Y.Oh I.L.Markov C.T.Weaver S.Chatterjee T.M.Austin
Talks about:
unsatisfi (2) minim (2) microprocessor (1) subformula (1) extractor (1) exponenti (1) algorithm (1) suppress (1) smallest (1) scalabl (1)

Person: Maher N. Mneimneh

DBLP DBLP: Mneimneh:Maher_N=

Contributed to:

SAT 20052005
DAC 20042004
SAT 20032003
DATE 20022002
DAC 20012001

Wrote 5 papers:

SAT-2005-MneimnehLASS #algorithm #bound #satisfiability
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas (MNM, IL, ZSA, JPMS, KAS), pp. 467–474.
DAC-2004-OhMASM #named #satisfiability
AMUSE: a minimally-unsatisfiable subformula extractor (YO, MNM, ZSA, KAS, ILM), pp. 518–523.
SAT-2003-MneimnehS #graph #scalability
Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution (MNM, KAS), pp. 411–425.
DATE-2002-AloulMS #satisfiability #search-based #using
Search-Based SAT Using Zero-Suppressed BDDs (FAA, MNM, KAS), p. 1082.
DAC-2001-MneimnehAWCSA #hybrid #scalability #verification
Scalable Hybrid Verification of Complex Microprocessors (MNM, FAA, CTW, SC, KAS, TMA), pp. 41–46.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.