An Automatic Speedup Theorem for Distributed Problems-Reference-Cited by-同舟云学术

An Automatic Speedup Theorem for Distributed Problems

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:

Brandt Sebastian¹

Affiliation:

1. ETH Zürich, Zurich, Switzerland

Publisher

ACM

Link

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

Reference24 articles.

1. Local and global properties in networks of processors (Extended Abstract)

2. Alkida Balliu Sebastian Brandt Juho Hirvonen Dennis Olivetti Mikaë l Rabie and Jukka Suomela. 2019. Lower bounds for maximal matchings and maximal independent sets. CoRR Vol. abs/1901.02441 (2019). arxiv: 1901.02441 http://arxiv.org/abs/1901.02441 Alkida Balliu Sebastian Brandt Juho Hirvonen Dennis Olivetti Mikaë l Rabie and Jukka Suomela. 2019. Lower bounds for maximal matchings and maximal independent sets. CoRR Vol. abs/1901.02441 (2019). arxiv: 1901.02441 http://arxiv.org/abs/1901.02441

3. New classes of distributed time complexity

4. Alkida Balliu Juho Hirvonen Dennis Olivetti and Jukka Suomela. 2018c. Hardness of minimal symmetry breaking in distributed computing. CoRR Vol. abs/1811.01643 (2018). 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. CoRR Vol. abs/1811.01643 (2018). arxiv: 1811.01643 http://arxiv.org/abs/1811.01643

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

1. The topology of local computing in networks;Journal of Applied and Computational Topology;2024-07-01

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

4. Distributed Graph Coloring Made Easy;ACM Transactions on Parallel Computing;2023-12-14

5. Distributed Symmetry Breaking on Power Graphs via Sparsification;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16