Simple Local Computation Algorithms for the General Lovász Local Lemma-Reference-Cited by-同舟云学术

Simple Local Computation Algorithms for the General Lovász Local Lemma

Published:2020-07-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Achlioptas Dimitris¹,Gouleakis Themis²,Iliopoulos Fotis³

Affiliation:

1. National and Kapodistrian University of Athens, Athens, Greece

2. Max-Planck-Institute for informatics, Saarbrucken, Germany

3. Institute for Advanced Study, Princeton, NJ, USA

Funder

Institute for Advanced Study

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3350755.3400250

Reference44 articles.

1. Random Walks That Find Perfect Objects and the Lovász Local Lemma

2. Dimitris Achlioptas Fotis Iliopoulos and Vladimir Kolmogorov. A local lemma for focused stochastic algorithms. rm To appear in SIAM Journal on Computing. Preprint at arXiv:1805.02026. Dimitris Achlioptas Fotis Iliopoulos and Vladimir Kolmogorov. A local lemma for focused stochastic algorithms. rm To appear in SIAM Journal on Computing. Preprint at arXiv:1805.02026.

3. Dimitris Achlioptas Fotis Iliopoulos and Alistair Sinclair. Beyond the Lovász local lemma: Point to set correlations and their algorithmic applications. rm To appear in Proceedings of IEEE FOCS 2019. Preprint at arXiv:1805.02026. URL: http://arxiv.org/abs/1805.02026 href http://arxiv.org/abs/1805.02026 patharXiv:1805.02026 . Dimitris Achlioptas Fotis Iliopoulos and Alistair Sinclair. Beyond the Lovász local lemma: Point to set correlations and their algorithmic applications. rm To appear in Proceedings of IEEE FOCS 2019. Preprint at arXiv:1805.02026. URL: http://arxiv.org/abs/1805.02026 href http://arxiv.org/abs/1805.02026 patharXiv:1805.02026 .

4. A parallel algorithmic version of the local lemma