@InProceedings{maus_et_al:LIPIcs.DISC.2021.31,
  author =	{Maus, Yannic and Uitto, Jara},
  title =	{{Efficient CONGEST Algorithms for the Lov\'{a}sz Local Lemma}},
  booktitle =	{35th International Symposium on Distributed Computing (DISC 2021)},
  pages =	{31:1--31:19},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-210-5},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{209},
  editor =	{Gilbert, Seth},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2021.31},
  URN =		{urn:nbn:de:0030-drops-148333},
  doi =		{10.4230/LIPIcs.DISC.2021.31},
  annote =	{Keywords: distributed graph algorithms, CONGEST, Lov\'{a}sz Local Lemma, locally checkable labelings}
}