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 × China
1 × Portugal
1 × USA
Collaborated with:
P.Zumstein R.A.Moser
Talks about:
unsatisfi (1) exponenti (1) algorithm (1) schöning (1) derandom (1) conflict (1) satisfi (1) famili (1) need (1) mani (1)

Person: Dominik Scheder

DBLP DBLP: Scheder:Dominik

Contributed to:

STOC 20112011
SAT 20082008
SAT 20072007

Wrote 3 papers:

STOC-2011-MoserS #algorithm #satisfiability
A full derandomization of schöning’s k-SAT algorithm (RAM, DS), pp. 245–252.
SAT-2008-SchederZ #how #question #satisfiability
How Many Conflicts Does It Need to Be Unsatisfiable? (DS, PZ), pp. 246–256.
SAT-2007-SchederZ #exponential #product line #satisfiability
Satisfiability with Exponential Families (DS, PZ), pp. 148–158.

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.