Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates-Reference-Cited by-同舟云学术

Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates

Published:2022-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Bezdrighin Marcel¹,Elkin Michael²,Ghaffari Mohsen¹,Grunau Christoph¹,Haeupler Bernhard³,Ilchi Saeed¹,Rozhoň Václav¹

Affiliation:

1. ETH Zurich, Zurich, Switzerland

2. Ben-Gurion University, Beersheba, Israel

3. ETH Zurich & Carnegie Mellon University, Zurich, Switzerland

Funder

Israel Science Foundation

NSF (National Science Foundation)

European Research Council

Publisher

ACM

Link

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

Reference55 articles.

1. The 4/3 Additive Spanner Exponent Is Tight

2. Graph spanners: A tutorial review

3. Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)

4. Baruch Awerbuch , Bonnie Berger , Lenore Cowen , and David Peleg . 1993 . Near- Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers. In 34th Annual Symposium on Foundations of Computer Science , Palo Alto, California, USA, 3- -5 November 1993. 638--647. https://doi.org/10.1109/SFCS.1993. 366823 10.1109/SFCS.1993 Baruch Awerbuch, Bonnie Berger, Lenore Cowen, and David Peleg. 1993. Near- Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers. In 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3--5 November 1993. 638--647. https://doi.org/10.1109/SFCS.1993. 366823

Cited by 4 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. Path-Reporting Distance Oracles with Logarithmic Stretch and Size O(n log log n);2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

3. Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11