Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems

9 August 2016

Papers citing "Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems"

12 / 12 papers shown

Title
Improved All-Pairs Approximate Shortest Paths in Congested Clique Hong Duc Bui Shashwat Chandra Yi-Jun Chang Michal Dory Dean Leitersdorf 84 2 0 04 May 2024
Distributed Subgraph Finding: Progress and Challenges K. Censor-Hillel 56 14 0 13 Mar 2022
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs K. Censor-Hillel Orr Fischer T. Gonen F. Gall Dean Leitersdorf R. Oshman 137 28 0 19 Jan 2021
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 69 13 0 10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model Fabian Kuhn P. Schneider 85 30 0 15 Jun 2020
Exponentially Faster Shortest Paths in the Congested Clique Michal Dory M. Parter 131 23 0 06 Mar 2020
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE Model Taisuke Izumi F. Gall 33 35 0 06 Jun 2019
Fast Approximate Shortest Paths in the Congested Clique K. Censor-Hillel Michal Dory Janne H. Korhonen Dean Leitersdorf 56 54 0 14 Mar 2019
$MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds$ MIS in the Congested Clique Model in $O(\log \log Δ)$ Rounds C. Konrad 35 8 0 21 Feb 2018
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model K. Censor-Hillel Dean Leitersdorf Elia Turner 46 34 0 13 Feb 2018
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions K. Censor-Hillel M. Parter Gregory Schwartzman 82 75 0 04 Aug 2016
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths Monika Henzinger Sebastian Krinninger Danupon Nanongkai 93 112 0 27 Apr 2015