Faster asynchronous MST and low diameter tree construction with sublinear communication

28 July 2019

Papers citing "Faster asynchronous MST and low diameter tree construction with sublinear communication"

7 / 7 papers shown

Title
A Near-Optimal Deterministic Distributed Synchronizer M. Ghaffari Anton Trygub 41 5 0 10 May 2023
An Almost Singularly Optimal Asynchronous Distributed MST Algorithm Fabien Dufoulon S. Kutten W. Moses Gopal Pandurangan David Peleg 68 5 0 03 Oct 2022
Singularly Near Optimal Leader Election in Asynchronous Networks S. Kutten W. Moses Gopal Pandurangan David Peleg 37 4 0 04 Aug 2021
Can We Break Symmetry with o(m) Communication? Shreyas Pai Gopal Pandurangan Sriram V. Pemmaraju Peter Robinson LRM 70 9 0 19 May 2021
Communication Costs in a Geometric Communication Network Sima Hajiaghaei Shanjani Valerie King GNN 42 0 0 27 Apr 2021
The Local Information Cost of Distributed Graph Spanners Peter Robinson 51 0 0 22 Mar 2020
Broadcast and minimum spanning tree with $o(m)$ messages in the asynchronous CONGEST model A. Mashreghi Valerie King 69 29 0 12 Jun 2018