Universally-Optimal Distributed Exact Min-Cut-Reference-Cited by-同舟云学术

Universally-Optimal Distributed Exact Min-Cut

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:

Ghaffari Mohsen¹,Zuzic Goran²

Affiliation:

1. MIT, Cambridge, MA, USA

2. ETH Zurich, Zurich, Switzerland

Funder

European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program

Swiss National Foundation

Publisher

ACM

Link

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

Reference31 articles.

1. Ruoxu Cen , Jason Li , Danupon Nanongkai , Debmalya Panigrahi , Kent Quanrud , and Thatchaphol Saranurak . 2021. Minimum Cuts in Directed Graphs via Partial Sparsification. arXiv preprint arXiv:2111.08959 ( 2021 ). Ruoxu Cen, Jason Li, Danupon Nanongkai, Debmalya Panigrahi, Kent Quanrud, and Thatchaphol Saranurak. 2021. Minimum Cuts in Directed Graphs via Partial Sparsification. arXiv preprint arXiv:2111.08959 (2021).

2. Deterministic coin tossing with applications to optimal parallel list ranking

3. Distributed edge connectivity in sublinear time

4. Distributed Verification and Hardness of Distributed Approximation

5. Distributed weighted min-cut in nearly-optimal time

Cited by 6 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. Polylog-Competitive Deterministic Local Routing and Scheduling;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

3. Secure Computation Meets Distributed Universal Optimality;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

4. Almost universally optimal distributed Laplacian solvers via low-congestion shortcuts;Distributed Computing;2023-07-31

5. Brief Announcement: Distributed Construction of Near-Optimal Compact Routing Schemes for Planar Graphs;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16