Efficient CONGEST Algorithms for the Lovász Local Lemma.

Yannic Maus, Jara Uitto

Research output: Contribution to conferencePaperpeer-review


We present a poly log log n time randomized CONGEST algorithm for a natural class of Lovász Local Lemma (LLL) instances on constant degree graphs. This implies, among other things, that there are no LCL problems with randomized complexity between Ω(log n) and poly log log n. Furthermore, we provide extensions to the network decomposition algorithms given in the recent breakthrough by Rozhoň and Ghaffari [STOC2020] and the follow up by Ghaffari, Grunau, and Rozhoň [SODA2021]. In particular, we show how to obtain a large distance separated weak network decomposition with a negligible dependency on the range of unique identifiers.

Original languageEnglish
Publication statusPublished - 1 Oct 2021
Externally publishedYes
Event35th International Symposium on Distributed Computing: DISC 2021 - Virtual, Freiburg, Germany
Duration: 4 Oct 20218 Oct 2021


Conference35th International Symposium on Distributed Computing
CityVirtual, Freiburg


  • Distributed graph algorithms
  • Locally checkable labelings
  • Lovász Local Lemma

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Efficient CONGEST Algorithms for the Lovász Local Lemma.'. Together they form a unique fingerprint.

Cite this