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. 1807.06624
  4. Cited By
Distributed Triangle Detection via Expander Decomposition

Distributed Triangle Detection via Expander Decomposition

17 July 2018
Yi-Jun Chang
Seth Pettie
Hengjie Zhang
ArXivPDFHTML

Papers citing "Distributed Triangle Detection via Expander Decomposition"

14 / 14 papers shown
Title
Detecting cliques in CONGEST networks
Detecting cliques in CONGEST networks
A. Czumaj
C. Konrad
40
36
0
03 Jul 2018
New Distributed Algorithms in Almost Mixing Time via Transformations
  from Parallel Algorithms
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms
M. Ghaffari
Jason Li
38
44
0
12 May 2018
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs
  Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in O~(n3/2)\tilde{O}(n^{3/2})O~(n3/2) Rounds
U. Agarwal
V. Ramachandran
Valerie King
Matteo Pontecorvi
21
38
0
15 Apr 2018
Fooling Views: A New Lower Bound Technique for Distributed Computations
  under Congestion
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion
Amir Abboud
K. Censor-Hillel
Seri Khoury
Christoph Lenzen
47
29
0
05 Nov 2017
A Faster Distributed Single-Source Shortest Paths Algorithm
A Faster Distributed Single-Source Shortest Paths Algorithm
Sebastian Krinninger
Danupon Nanongkai
43
65
0
03 Nov 2017
Distributed Exact Weighted All-Pairs Shortest Paths in $\tilde
  O(n^{5/4})$ Rounds
Distributed Exact Weighted All-Pairs Shortest Paths in O~(n5/4)\tilde O(n^{5/4})O~(n5/4) Rounds
Chien-Chung Huang
Danupon Nanongkai
Thatchaphol Saranurak
37
45
0
13 Aug 2017
MST in O(1) Rounds of the Congested Clique
MST in O(1) Rounds of the Congested Clique
T. Jurdzinski
Krzysztof Nowicki
LRM
49
92
0
26 Jul 2017
Deterministic subgraph detection in broadcast CONGEST
Deterministic subgraph detection in broadcast CONGEST
Janne H. Korhonen
Joel Rybicki
68
52
0
29 May 2017
Triangle Finding and Listing in CONGEST Networks
Triangle Finding and Listing in CONGEST Networks
Taisuke Izumi
F. Gall
46
55
0
25 May 2017
On the Distributed Complexity of Large-Scale Graph Computations
On the Distributed Complexity of Large-Scale Graph Computations
Gopal Pandurangan
Peter Robinson
Michele Scquizzato
50
53
0
26 Feb 2016
Algebraic Methods in the Congested Clique
Algebraic Methods in the Congested Clique
K. Censor-Hillel
P. Kaski
Janne H. Korhonen
Christoph Lenzen
A. Paz
Jukka Suomela
33
160
0
17 Mar 2015
Optimal Deterministic Routing and Sorting on the Congested Clique
Optimal Deterministic Routing and Sorting on the Congested Clique
Christoph Lenzen
67
168
0
08 Jul 2012
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed
  Setting
"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting
Danny Dolev
Christoph Lenzen
Shir Peled
66
111
0
31 Jan 2012
Distributed Verification and Hardness of Distributed Approximation
Distributed Verification and Hardness of Distributed Approximation
Atish Das Sarma
S. Holzer
Liah Kor
Amos Korman
Danupon Nanongkai
Gopal Pandurangan
David Peleg
Roger Wattenhofer
83
346
0
12 Nov 2010
1