4 citations · 19 across the 11 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
A new notion of commutativity for the algorithmic Lovász Local Lemma
David G. Harris, Fotis Iliopoulos, Vladimir Kolmogorov
The Lovász Local Lemma (LLL) is a powerful tool in probabilistic combinatorics which can be used to establish the existence of objects that satisfy certain properties. The breakthr…
cs.DS2018
Simple Local Computation Algorithms for the General Lovasz Local Lemma
Dimitris Achlioptas, Themis Gouleakis, Fotis Iliopoulos
We consider the task of designing Local Computation Algorithms (LCA) for applications of the Lovász Local Lemma (LLL). LCA is a class of sublinear algorithms proposed by Rubinfeld…