The Laplacian Paradigm in the Broadcast Congested Clique-Reference-Cited by-同舟云学术

The Laplacian Paradigm in the Broadcast Congested Clique

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:

Forster Sebastian¹,de Vos Tijn¹

Affiliation:

1. University of Salzburg, Salzburg, Austria

Funder

Austrian Science Fund

European Research Council

Publisher

ACM

Link

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

Reference44 articles.

1. Database-friendly random projections: Johnson-Lindenstrauss with binary coins

2. Ioannis Anagnostides , Themis Gouleakis , and Christoph Lenzen . 2021. Accelerated Distributed Laplacian Solvers via Shortcuts. CoRR abs/2109.05151 ( 2021 ). arXiv:2109.05151 Ioannis Anagnostides, Themis Gouleakis, and Christoph Lenzen. 2021. Accelerated Distributed Laplacian Solvers via Shortcuts. CoRR abs/2109.05151 (2021). arXiv:2109.05151

3. Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving

4. Owe Axelsson . 1996. Iterative solution methods . Cambridge university press . Owe Axelsson. 1996. Iterative solution methods. Cambridge university press.

5. Faster Sparse Minimum Cost Flow by Electrical Flow Localization

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

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

2. Coloring Fast with Broadcasts;Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures;2023-06-17

3. Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16

4. Brief Announcement: Minimum Cost Maximum Flow in the CONGEST Model;Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing;2023-06-16