Exponentially Faster Shortest Paths in the Congested Clique

DOI10.1145/3382734.3405711OpenAlexW3046260980WikidataQ130860389 ScholiaQ130860389MaRDI QIDQ5855208

Michal Dory, Merav Parter

Publication date: 15 March 2021

Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.03058

zbMATH Keywords

shortest pathscongested cliquenear-additive emulator

Mathematics Subject Classification ID

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

Related Items (2)

Near-optimal clustering in the \(k\)-machine model ⋮ Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC

This page was built for publication: Exponentially Faster Shortest Paths in the Congested Clique