The Landscape of Distributed Complexities on Trees and Beyond-Reference-Cited by-同舟云学术

The Landscape of Distributed Complexities on Trees and Beyond

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

Author:

Grunau Christoph¹,Rozhoň Václav¹,Brandt Sebastian²

Affiliation:

1. ETH Zurich, Zurich, Switzerland

2. CISPA Helmholtz Center for Information Security, Saarbrücken, Germany

Funder

European Research Council

Publisher

ACM

Link

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

Reference45 articles.

1. Space-efficient Local Computation Algorithms

2. The Distributed Complexity of Locally Checkable Problems on Paths is Decidable

3. Alkida Balliu , Sebastian Brandt , Yuval Efron , Juho Hirvonen , Yannic Maus , Dennis Olivetti , and Jukka Suomela . 2020 . Classification of Distributed Binary Labeling Problems. In 34th International Symposium on Distributed Computing, DISC 2020, October 12--16, 2020, Virtual Conference. 17:1--17:17 . https://doi.org/10.4230/LIPIcs. DISC.2020.17 arXiv:1911.13294 10.4230/LIPIcs Alkida Balliu, Sebastian Brandt, Yuval Efron, Juho Hirvonen, Yannic Maus, Dennis Olivetti, and Jukka Suomela. 2020. Classification of Distributed Binary Labeling Problems. In 34th International Symposium on Distributed Computing, DISC 2020, October 12--16, 2020, Virtual Conference. 17:1--17:17. https://doi.org/10.4230/LIPIcs. DISC.2020.17 arXiv:1911.13294

4. Lower Bounds for Maximal Matchings and Maximal Independent Sets

5. Alkida Balliu , Sebastian Brandt , Fabian Kuhn , and Dennis Olivetti . 2021. Distributed -Coloring Plays Hide-and-Seek. CoRR abs/2110.00643 ( 2021 ). arXiv:2110.00643 https://arxiv.org/abs/2110.00643 Alkida Balliu, Sebastian Brandt, Fabian Kuhn, and Dennis Olivetti. 2021. Distributed -Coloring Plays Hide-and-Seek. CoRR abs/2110.00643 (2021). arXiv:2110.00643 https://arxiv.org/abs/2110.00643

Cited by 3 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. Distributed half-integral matching and beyond;Theoretical Computer Science;2024-01

3. Local problems on grids from the perspective of distributed algorithms, finitary factors, and descriptive combinatorics;Advances in Mathematics;2023-10