Constant-Round Near-Optimal Spanners in Congested Clique

DOI10.1145/3519270.3538439MaRDI QIDQ6202177zbMATH OpenFDO

Authors Shiri Chechik, Tianyi Zhang

Publication date 26 March 2024

Published in Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3519270.3538439

zbMATH Keywords

shortest pathsspannerscongested clique

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited in

(3)

• Improved all-pairs approximate shortest paths in congested clique
• Improved all-pairs approximate shortest paths in congested clique
• Constant-round spanners and shortest paths in congested clique and MPC

This page was built for publication: Constant-Round Near-Optimal Spanners in Congested Clique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202177)