Parallel algorithms and concentration bounds for the Lovász Local Lemma via witness-DAGs

Bernhard Haeupler, David G. Harris. Parallel algorithms and concentration bounds for the Lovász Local Lemma via witness-DAGs. In Philip N. Klein, editor, Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19. pages 1170-1187, SIAM, 2017. [doi]

@inproceedings{HaeuplerH17,
  title = {Parallel algorithms and concentration bounds for the Lovász Local Lemma via witness-DAGs},
  author = {Bernhard Haeupler and David G. Harris},
  year = {2017},
  doi = {10.1137/1.9781611974782.76},
  url = {http://dx.doi.org/10.1137/1.9781611974782.76},
  researchr = {https://researchr.org/publication/HaeuplerH17},
  cites = {0},
  citedby = {0},
  pages = {1170-1187},
  booktitle = {Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, Barcelona, Spain, Hotel Porta Fira, January 16-19},
  editor = {Philip N. Klein},
  publisher = {SIAM},
  isbn = {978-1-61197-478-2},
}