A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP

23 September 2024

Papers citing "A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP"

10 / 10 papers shown

Title
Distributed MIS with Low Energy and Time Complexities M. Ghaffari Julian Portmann 37 10 0 19 May 2023
Average Awake Complexity of MIS and Matching M. Ghaffari Julian Portmann 38 13 0 10 May 2023
Parallel Breadth-First Search and Exact Shortest Paths and Stronger Notions for Approximate Distances Václav Rozhon Bernhard Haeupler A. Martinsson Christoph Grunau Goran Zuzic 92 14 0 28 Oct 2022
How to Wake Up Your Neighbors: Safe and Nearly Optimal Generic Energy Conservation in Radio Networks Varsha Dani Thomas P. Hayes 51 7 0 25 May 2022
The Energy Complexity of BFS in Radio Networks Yi-Jun Chang Varsha Dani Thomas P. Hayes Seth Pettie 15 22 0 19 Jul 2020
Faster Deterministic All Pairs Shortest Paths in Congest Model U. Agarwal V. Ramachandran 40 23 0 19 May 2020
Improved Distributed Algorithms for Exact Shortest Paths M. Ghaffari Jason Li 38 60 0 25 Dec 2017
A Faster Distributed Single-Source Shortest Paths Algorithm Sebastian Krinninger Danupon Nanongkai 43 65 0 03 Nov 2017
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths Monika Henzinger Sebastian Krinninger Danupon Nanongkai 75 112 0 27 Apr 2015
Distributed Verification and Hardness of Distributed Approximation Atish Das Sarma S. Holzer Liah Kor Amos Korman Danupon Nanongkai Gopal Pandurangan David Peleg Roger Wattenhofer 85 346 0 12 Nov 2010