Simple Local Computation Algorithms for the General Lovasz Local Lemma
SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures Virtual Event USA July, 2020, pp. 1-10, 2020.
We consider the task of designing Local Computation Algorithms (LCA) for applications of the Lovasz Local Lemma (LLL). LCA is a class of sublinear algorithms proposed by Rubinfeld et al. that have received a lot of attention in recent years. The LLL is an existential, sufficient condition for a collection of sets to have non-empty interse...More
PPT (Upload PPT)