Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model

16 May 2017

Papers citing "Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model"

11 / 11 papers shown

Title
Lower Bounds for Induced Cycle Detection in Distributed Computing Franccois Le Gall Masayuki Miyamoto 24 6 0 02 Oct 2021
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters Janne H. Korhonen Amir Nikabadi GNN 38 4 0 14 Sep 2021
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching Naoki Kitamura Taisuke Izumi 37 5 0 25 Apr 2021
Distributed Distance Approximation Bertie Ancona K. Censor-Hillel M. Dalirrooyfard Yuval Efron Virginia Vassilevska Williams 38 9 0 10 Nov 2020
Faster Deterministic All Pairs Shortest Paths in Congest Model U. Agarwal V. Ramachandran 4 19 0 19 May 2020
Distributed Maximum Matching Verification in CONGEST Mohamad Ahmadi Fabian Kuhn 16 7 0 18 Feb 2020
Hardness of Distributed Optimization Nir Bachrach K. Censor-Hillel Michal Dory Yuval Efron Dean Leitersdorf A. Paz 15 41 0 24 May 2019
Smaller Cuts, Higher Lower Bounds Amir Abboud K. Censor-Hillel Seri Khoury A. Paz 14 29 0 07 Jan 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time A. Bernstein K. Kirchberg 16 49 0 08 Nov 2018
Detecting cliques in CONGEST networks A. Czumaj C. Konrad 11 35 0 03 Jul 2018
Superlinear Lower Bounds for Distributed Subgraph Detection Orr Fischer T. Gonen R. Oshman 18 1 0 18 Nov 2017