Derandomizing the Lovasz Local Lemma more effectively - Robin A. Moser (CoRR, 2008)

The Lovász Local Lemma and Satisfiability. - Heidi Gebauer; Robin A. Moser; Dominik Scheder; Emo Welzl (Efficient Algorithms, 2009)

A constructive proof of the Lovász local lemma. - Robin A. Moser (STOC, 2009)

A Full Derandomization of Schoening's k-SAT Algorithm - Robin A. Moser; Dominik Scheder (CoRR, 2010)

Improving PPSZ for 3-SAT using Crtitical Variables - Timon Hertli; Robin A. Moser; Dominik Scheder (CoRR, 2010)

A constructive proof of the general lovász local lemma. - Robin A. Moser; Gábor Tardos (J. ACM, 2010)

Improving PPSZ for 3-SAT using Critical Variables. - Timon Hertli; Robin A. Moser; Dominik Scheder (STACS, 2011)

A full derandomization of schöning's k-SAT algorithm. - Robin A. Moser; Dominik Scheder (STOC, 2011)

Not All Saturated 3-Forests Are Tight - Heidi Gebauer; Anna Gundert; Robin A. Moser; Yoshio Okamoto (CoRR, 2011)

Exakte Algorithmen für Erfüllbarkeitsprobleme. - Robin A. Moser (Ausgezeichnete Informatikdissertationen, 2012)

Vectors in a box. - Kevin Buchin; Jirí Matousek 001; Robin A. Moser; Dömötör Pálvölgyi (Math. Program., 2012)

Exact algorithms for constraint satisfaction problems. - Robin A. Moser (Logos-Verlag, 2013)

The PPSZ Algorithm for Constraint Satisfaction Problems on More Than Two Colors. - Timon Hertli; Isabelle Hurbain; Sebastian Millius; Robin A. Moser; Dominik Scheder; May Szedlák (CP, 2016)