Universally-optimal distributed algorithms for known topologies-Reference-Cited by-同舟云学术

Universally-optimal distributed algorithms for known topologies

Published:2021-06-15 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Haeupler Bernhard¹^ORCID,Wajc David²^ORCID,Zuzic Goran³^ORCID

Affiliation:

1. Carnegie Mellon University, USA / ETH Zurich, Switzerland

2. Stanford University, USA

3. ETH Zurich, Switzerland

Funder

NSF (National Science Foundation)

Sloan Research Fellowship

Swiss National Foundation

Office of Naval Research

Publisher

ACM

Link

Reference69 articles.

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

1. Fast Broadcast in Highly Connected Networks;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;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. Deterministic Expander Routing: Faster and More Versatile;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

5. Polylog-Competitive Deterministic Local Routing and Scheduling;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10