Robin A. Moser

According to our database, Robin A. Moser authored at least 13 papers between 2008 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

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

Proceedings of the Principles and Practice of Constraint Programming, 2016

2013

Exact algorithms for constraint satisfaction problems.

Robin A. Moser

PhD thesis, 2013

2012

Vectors in a box.

Kevin Buchin, Jirí Matousek, Robin A. Moser, Dömötör Pálvölgyi

Math. Program., 2012

Exakte Algorithmen für Erfüllbarkeitsprobleme.

Robin A. Moser

Proceedings of the Ausgezeichnete Informatikdissertationen 2012, 2012

2011

Not All Saturated 3-Forests Are Tight

Heidi Gebauer, Anna Gundert, Robin A. Moser, Yoshio Okamoto

CoRR, 2011

A full derandomization of schöning's k-SAT algorithm.

Robin A. Moser, Dominik Scheder

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

Improving PPSZ for 3-SAT using Critical Variables.

Timon Hertli, Robin A. Moser, Dominik Scheder

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

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 Crtitical Variables

Timon Hertli, Robin A. Moser, Dominik Scheder

CoRR, 2010

A Full Derandomization of Schoening's k-SAT Algorithm

Robin A. Moser, Dominik Scheder

CoRR, 2010

2009

A constructive proof of the Lovász local lemma.

Robin A. Moser

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

The Lovász Local Lemma and Satisfiability.

Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl

Proceedings of the Efficient Algorithms, 2009

2008

Derandomizing the Lovasz Local Lemma more effectively

Robin A. Moser

CoRR, 2008