Fast Approximate Shortest Paths in the Congested Clique

14 March 2019

Papers citing "Fast Approximate Shortest Paths in the Congested Clique"

8 / 8 papers shown

Title
Improved All-Pairs Approximate Shortest Paths in Congested Clique Hong Duc Bui Shashwat Chandra Yi-Jun Chang Michal Dory Dean Leitersdorf 43 2 0 04 May 2024
Distributed Subgraph Finding: Progress and Challenges K. Censor-Hillel 43 14 0 13 Mar 2022
Sparse Matrix Multiplication in the Low-Bandwidth Model Chetan Gupta J. Hirvonen Janne H. Korhonen Jan Studený Jukka Suomela 16 4 0 02 Mar 2022
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs K. Censor-Hillel Orr Fischer T. Gonen F. Gall Dean Leitersdorf R. Oshman 120 26 0 19 Jan 2021
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 38 9 0 10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 14 31 0 15 Jun 2020
Exponentially Faster Shortest Paths in the Congested Clique Michal Dory M. Parter 108 23 0 06 Mar 2020
Distributed MST: A Smoothed Analysis Soumyottam Chatterjee Gopal Pandurangan N. Pham 17 10 0 06 Nov 2019