Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks

17 May 2016

Papers citing "Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks"

25 / 25 papers shown

Title
Complexity of Eccentricities and All-Pairs Shortest Paths in the Quantum CONGEST Model Changsheng Wang Xudong Wu Penghui Yao 33 4 0 06 Jun 2022
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters Janne H. Korhonen Amir Nikabadi GNN 91 5 0 14 Sep 2021
Locally Checkable Labelings with Small Messages Alkida Balliu K. Censor-Hillel Yannic Maus Dennis Olivetti Jukka Suomela 35 16 0 12 May 2021
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 74 13 0 10 Nov 2020
The Energy Complexity of BFS in Radio Networks Yi-Jun Chang Varsha Dani Thomas P. Hayes Seth Pettie 23 22 0 19 Jul 2020
Input-Dynamic Distributed Algorithms for Communication Networks Klaus-Tycho Foerster Janne H. Korhonen A. Paz Joel Rybicki Stefan Schmid 38 3 0 15 May 2020
Quantum Distributed Complexity of Set Disjointness on a Line F. Magniez A. Nayak 16 9 0 26 Feb 2020
Shortest Paths in a Hybrid Network Model John E. Augustine Kristian Hinnenthal Fabian Kuhn Christian Scheideler P. Schneider 47 31 0 04 Sep 2019
Low-Congestion Shortcut and Graph Parameters Naoki Kitamura Hirotaka Kitagawa Y. Otachi Taisuke Izumi 37 9 0 26 Aug 2019
What graph neural networks cannot learn: depth vs width Andreas Loukas GNN 93 301 0 06 Jul 2019
Hardness of Distributed Optimization Nir Bachrach K. Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf A. Paz 56 41 0 24 May 2019
Distributed Edge Connectivity in Sublinear Time Mohit Daga Monika Henzinger Danupon Nanongkai Thatchaphol Saranurak 55 40 0 08 Apr 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 61 54 0 14 Mar 2019
A stack-vector routing protocol for automatic tunneling Mohamed Lamine Lamali Simon Lassourreuille Stephan Kunne Johanne Cohen 13 7 0 24 Jan 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 54 29 0 07 Jan 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 62 53 0 08 Nov 2018
The Sparsest Additive Spanner via Multiple Weighted BFS Trees Ya-Ping Hsieh Chen Liu Volkan Cevher 55 4 0 05 Nov 2018
Parameterized Distributed Algorithms Ran Ben-Basat Ken-ichi Kawarabayashi Gregory Schwartzman 48 14 0 13 Jul 2018
Sublinear-Time Quantum Computation of the Diameter in CONGEST Networks F. Gall F. Magniez 29 44 0 09 Apr 2018
Redundancy in Distributed Proofs Laurent Feuilloley Pierre Fraigniaud J. Hirvonen A. Paz M. Perry 55 28 0 08 Mar 2018
Distributed Spanner Approximation K. Censor-Hillel Michal Dory 64 25 0 09 Feb 2018
$Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds$ Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde O(n^{5/4})$ Rounds Chien-Chung Huang Danupon Nanongkai Thatchaphol Saranurak 56 45 0 13 Aug 2017
Distributed Subgraph Detection Pierre Fraigniaud Pedro Montealegre Dennis Olivetti I. Rapaport Ioan Todinca 66 11 0 13 Jun 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model K. Censor-Hillel Seri Khoury A. Paz 75 55 0 16 May 2017
A Note on Hardness of Diameter Approximation K. Bringmann Sebastian Krinninger 39 8 0 05 May 2017