@inproceedings{eba7ab7ceebd41aab76bac888414e952,

title = "A lower bound for the distributed Lov{\'a}sz local lemma",

abstract = "We show that any randomised Monte Carlo distributed algorithm for the Lov{\'a}sz local lemma requires Ω(log log n) communication rounds, assuming that it finds a correct assignment with high probability. Our result holds even in the special case of d ∈ O(1), where d is the maximum degree of the dependency graph. By prior work, there are distributed algorithms for the Lov{\'a}sz local lemma with a running time of O(logn) rounds in bounded-degree graphs, and the best lower bound before our work was Ω(log∗ n) rounds [Chung et al. 2014].",

keywords = "Distributed complexity, Graph colouring, Locality, Lov{\'a}sz local lemma, Lower bounds, Sinkless orientations",

author = "Sebastian Brandt and Orr Fischer and Juho Hirvonen and Barbara Keller and Tuomo Lempi{\"a}inen and Joel Rybicki and Jukka Suomela and Jara Uitto",

year = "2016",

month = jun,

day = "19",

doi = "10.1145/2897518.2897570",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery",

pages = "479--488",

editor = "Yishay Mansour and Daniel Wichs",

booktitle = "STOC 2016 - Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing",

note = "48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016 ; Conference date: 19-06-2016 Through 21-06-2016",

}