BibSLEIGH
BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
EDIT!
CC-BY
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × China
1 × Italy
1 × Portugal
2 × Canada
2 × United Kingdom
Collaborated with:
M.Heule L.v.Norden S.Wieringa B.Schaafsma M.Dufour J.v.Zwieten
Talks about:
reason (3) sat (3) satisfi (2) equival (2) densiti (2) align (2) ahead (2) look (2) cnf (2) threshold (1)

Person: Hans van Maaren

DBLP DBLP: Maaren:Hans_van

Contributed to:

SAT 20092009
SAT 20082008
SAT 20072007
SAT 20052005
SAT 20042004
SAT 20042005
SAT 20032003

Wrote 10 papers:

SAT-2009-SchaafsmaHM #simulation #symmetry
Dynamic Symmetry Breaking by Simulating Zykov Contraction (BS, MH, HvM), pp. 223–236.
SAT-2008-MaarenW #performance
Finding Guaranteed MUSes Fast (HvM, SW), pp. 291–304.
SAT-2007-HeuleM #multi
From Idempotent Generalized Boolean Assignments to Multi-bit Search (MH, HvM), pp. 134–147.
SAT-2007-HeuleM07a #effectiveness
Effective Incorporation of Double Look-Ahead Procedures (MH, HvM), pp. 258–271.
SAT-2005-HeuleM #bound #linear #programming #random #satisfiability #using
Observed Lower Bounds for Random 3-SAT Phase Transition Density Using Linear Programming (MH, HvM), pp. 122–134.
SAT-2005-MaarenN #satisfiability
Sums of Squares, Satisfiability and Maximum Satisfiability (HvM, LvN), pp. 294–308.
SAT-2004-HeuleM
Aligning CNF- and Equivalence-reasoning (MH, HvM), pp. 174–180.
SAT-J-2004-HeuleDZM05 #implementation #named #performance #reasoning #satisfiability
March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver (MH, MD, JvZ, HvM), pp. 345–359.
SAT-J-2004-HeuleM05
Aligning CNF- and Equivalence-Reasoning (MH, HvM), pp. 145–156.
SAT-2003-MaarenN
Hidden Threshold Phenomena for Fixed-Density SAT-formulae (HvM, LvN), pp. 135–149.

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.