|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 11 publication records. Showing 11 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Heidi Gebauer, Anna Gundert, Robin A. Moser, Yoshio Okamoto |
Not All Saturated 3-Forests Are Tight  |
CoRR  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Timon Hertli, Robin A. Moser, Dominik Scheder |
Improving PPSZ for 3-SAT using Critical Variables. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin A. Moser, Dominik Scheder |
A full derandomization of schöning's k-SAT algorithm. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin A. Moser, Gábor Tardos |
A constructive proof of the general lovász local lemma. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin A. Moser, Dominik Scheder |
A Full Derandomization of Schoening's k-SAT Algorithm |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Timon Hertli, Robin A. Moser, Dominik Scheder |
Improving PPSZ for 3-SAT using Crtitical Variables |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Robin A. Moser, Gábor Tardos |
A constructive proof of the general Lovasz Local Lemma |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl |
The Lovász Local Lemma and Satisfiability. |
Efficient Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Robin A. Moser |
A constructive proof of the Lovász local lemma. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
bounded occurrence sat instances, hypergraph colouring, derandomization, Lovasz local lemma |
| 1 | Robin A. Moser |
Derandomizing the Lovasz Local Lemma more effectively |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Robin A. Moser |
A constructive proof of the Lovasz Local Lemma |
CoRR |
2008 |
DBLP BibTeX RDF |
|
Displaying result #1 - #11 of 11 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")