2 papers
cs.DC2025
Sublinear-Time Sampling of Spanning Trees in the Congested Clique
Sriram V. Pemmaraju, Sourya Roy, Joshua Z. Sobel
We present the first sublinear-in- round algorithm for sampling an approximately uniform spanning tree of an -vertex graph in the CongestedClique model of distributed computi…
cs.DC2025
Message Optimality and Message-Time Trade-offs for APSP and Beyond
Fabien Dufoulon, Shreyas Pai, Gopal Pandurangan +2
Round complexity is an extensively studied metric of distributed algorithms. In contrast, our knowledge of the \emph{message complexity} of distributed computing problems and its r…