Hardness of Minimal Symmetry Breaking in Distributed Computing-Reference-Cited by-同舟云学术

Hardness of Minimal Symmetry Breaking in Distributed Computing

Published:2019-07-16 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing
language:
Short-container-title:

Author:

Balliu Alkida¹,Hirvonen Juho¹,Olivetti Dennis¹,Suomela Jukka¹

Affiliation:

1. Aalto University, Espoo, Finland

Funder

Academy of Finland

Publisher

ACM

Link

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

Reference24 articles.

1. New classes of distributed time complexity

2. Alkida Balliu Juho Hirvonen Dennis Olivetti and Jukka Suomela. 2018c. Hardness of minimal symmetry breaking in distributed computing. arxiv: 1811.01643 http://arxiv.org/abs/1811.01643 Alkida Balliu Juho Hirvonen Dennis Olivetti and Jukka Suomela. 2018c. Hardness of minimal symmetry breaking in distributed computing. arxiv: 1811.01643 http://arxiv.org/abs/1811.01643

3. Leonid Barenboim and Michael Elkin. 2013. Distributed Graph Coloring: Fundamentals and Recent Developments. Vol. 4. Leonid Barenboim and Michael Elkin. 2013. Distributed Graph Coloring: Fundamentals and Recent Developments. Vol. 4.

4. A lower bound for the distributed Lovász local lemma

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

1. Completing the Node-Averaged Complexity Landscape of LCLs on Trees;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. Locally checkable problems in rooted trees;Distributed Computing;2022-08-22

3. The Landscape of Distributed Complexities on Trees and Beyond;Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing;2022-07-20

4. Distributed ∆-coloring plays hide-and-seek;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

5. Distributed Lower Bounds for Ruling Sets;SIAM Journal on Computing;2022-02