6 citations · 33 across the 33 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2015
Parallel algorithms and concentration bounds for the Lovasz Local Lemma via witness DAGs
Bernhard Haeupler, David G. Harris
The Lovász Local Lemma (LLL) is a cornerstone principle in the probabilistic method of combinatorics, and a seminal algorithm of Moser & Tardos (2010) provides an efficient randomi…
cs.DM2015
Algorithmic and enumerative aspects of the Moser-Tardos distribution
David G. Harris, Aravind Srinivasan
Moser & Tardos have developed a powerful algorithmic approach (henceforth "MT") to the Lovasz Local Lemma (LLL); the basic operation done in MT and its variants is a search for "ba…