v1v2 (latest)

Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time

Symposium on the Theory of Computing (STOC), 2018

8 November 2018

A. Bernstein

K. Kirchberg

ArXiv (abs)PDF HTML

Papers citing "Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time"

21 / 21 papers shown

Title
Fast Broadcast in Highly Connected Networks Shashwat Chandra Yi-Jun Chang Michal Dory Mohsen Ghaffari Dean Leitersdorf 114 1 0 19 Apr 2024
Polylogarithmic Time Algorithms for Shortest Path Forests in Programmable Matter Andreas Padalkin Christian Scheideler 124 5 0 19 Feb 2024
ZePoP: A Distributed Leader Election Protocol using the Delay-based Closeness Centrality for Peer-to-Peer Applications Md. Amjad Hossain Javed Khan 52 1 0 05 Aug 2023
Optimal Message-Passing with Noisy BeepsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 Peter Davies 96 4 0 27 Mar 2023
Delay-aware Backpressure Routing Using Graph Neural NetworksIEEE International Conference on Acoustics, Speech, and Signal Processing (ICASSP), 2022 Zhongyuan Zhao Bojan Radojicic Gunjan Verma A. Swami Santiago Segarra 77 11 0 19 Nov 2022
Quantum Complexity of Weighted Diameter and Radius in CONGEST NetworksACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 Xudong Wu Penghui Yao MQ 196 15 0 06 Jun 2022
Near Optimal Bounds for Replacement Paths and Related Problems in the CONGEST Model Vignesh Manoharan V. Ramachandran 169 4 0 30 May 2022
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 154 7 0 25 Apr 2021
Minor Sparsifiers and the Distributed Laplacian ParadigmIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020 S. Forster Gramoz Goranci Yang P. Liu Richard Peng Xiaorui Sun Mingquan Ye 225 22 0 31 Dec 2020
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 194 13 0 10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 277 33 0 15 Jun 2020
Faster Deterministic All Pairs Shortest Paths in Congest Model U. Agarwal V. Ramachandran 101 24 0 19 May 2020
Simple and Fast Distributed Computation of Betweenness CentralityIEEE Conference on Computer Communications (INFOCOM), 2020 P. Crescenzi Pierre Fraigniaud A. Paz 68 5 0 22 Jan 2020
Shortest Paths in a Hybrid Network ModelACM-SIAM Symposium on Discrete Algorithms (SODA), 2019 John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 114 34 0 04 Sep 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE ModelACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2019 Taisuke Izumi F. Gall 108 39 0 06 Jun 2019
Hardness of Distributed OptimizationACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2019 Nir Bachrach K. Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf A. Paz 128 41 0 24 May 2019
Distributed Edge Connectivity in Sublinear Time Mohit Daga Monika Henzinger Danupon Nanongkai Thatchaphol Saranurak 108 41 0 08 Apr 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 148 55 0 14 Mar 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 190 29 0 07 Jan 2019
The Sparsest Additive Spanner via Multiple Weighted BFS Trees Ya-Ping Hsieh Chen Liu Volkan Cevher 155 4 0 05 Nov 2018
Distributed Algorithms for Directed Betweenness Centrality and All Pairs Shortest Paths Matteo Pontecorvi V. Ramachandran GNN 97 11 0 21 May 2018