Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel

David G. Harris 0001. Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 1744-1779, SIAM, 2022. [doi]

@inproceedings{Harris22,
  title = {Deterministic algorithms for the Lovász Local Lemma: simpler, more general, and more parallel},
  author = {David G. Harris 0001},
  year = {2022},
  doi = {10.1137/1.9781611977073.71},
  url = {https://doi.org/10.1137/1.9781611977073.71},
  researchr = {https://researchr.org/publication/Harris22},
  cites = {0},
  citedby = {0},
  pages = {1744-1779},
  booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022},
  editor = {Joseph (Seffi) Naor and Niv Buchbinder},
  publisher = {SIAM},
  isbn = {978-1-61197-707-3},
}