A lower bound for the distributed Lovász local lemma-Reference-Cited by-同舟云学术

A lower bound for the distributed Lovász local lemma

Published:2016-06-19 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
language:
Short-container-title:

Author:

Brandt Sebastian¹,Fischer Orr²,Hirvonen Juho³,Keller Barbara¹,Lempiäinen Tuomo³,Rybicki Joel³,Suomela Jukka³,Uitto Jara⁴

Affiliation:

1. ETH Zurich, Switzerland

2. Tel Aviv University, Israel

3. Aalto University, Finland

4. Bitsplitters, Switzerland

Publisher

ACM

Link

Reference72 articles.

1. ep(d + 1) < 1 O(log n log d) {11 19} epd 2 < 1 O(log n) ep(d + 1) < 1 O(log n log d) {11 19} epd 2 < 1 O(log n)

2. pf (d) < 1 where f (d) exponential O(log n/ log log n) pf (d) < 1 where f (d) exponential O(log n/ log log n)

3. pf (d) ≤ 1 for any f Ω(log ∗ n) pf (d) ≤ 1 for any f Ω(log ∗ n)

5. Lecture Notes in Computer Science;Alon N.

Cited by 74 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief Announcement: Local Advice and Local Decompression;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Tight Lower Bounds in the Supported LOCAL Model;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

3. No Distributed Quantum Advantage for Approximate Graph Coloring;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

5. ON HOMOMORPHISM GRAPHS;Forum of Mathematics, Pi;2024