ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1705.05646
  4. Cited By
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model

Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model

16 May 2017
K. Censor-Hillel
Seri Khoury
A. Paz
ArXivPDFHTML

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

7 / 7 papers shown
Title
Lower Bounds for Induced Cycle Detection in Distributed Computing
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
Beyond Distributed Subgraph Detection: Induced Subgraphs, Multicolored Problems and Graph Parameters
Janne H. Korhonen
Amir Nikabadi
GNN
33
4
0
14 Sep 2021
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
Naoki Kitamura
Taisuke Izumi
21
5
0
25 Apr 2021
Distributed Distance Approximation
Distributed Distance Approximation
Bertie Ancona
K. Censor-Hillel
M. Dalirrooyfard
Yuval Efron
Virginia Vassilevska Williams
17
9
0
10 Nov 2020
Distributed Maximum Matching Verification in CONGEST
Distributed Maximum Matching Verification in CONGEST
Mohamad Ahmadi
Fabian Kuhn
11
7
0
18 Feb 2020
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
A. Bernstein
K. Kirchberg
11
49
0
08 Nov 2018
Superlinear Lower Bounds for Distributed Subgraph Detection
Superlinear Lower Bounds for Distributed Subgraph Detection
Orr Fischer
T. Gonen
R. Oshman
13
1
0
18 Nov 2017
1