ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1904.08037
  4. Cited By
Improved Distributed Expander Decomposition and Nearly Optimal Triangle
  Enumeration
v1v2 (latest)

Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration

17 April 2019
Yi-Jun Chang
Thatchaphol Saranurak
ArXiv (abs)PDFHTML

Papers citing "Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration"

25 / 25 papers shown
Distributed Complexity of $P_k$-freeness: Decision and Certification
Distributed Complexity of PkP_kPk​-freeness: Decision and Certification
Masayuki Miyamoto
196
2
0
27 Oct 2024
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General
  Forms of Sparsity
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
Chetan Gupta
Janne H. Korhonen
Jan Studený
Jukka Suomela
Hossein Vahidi
174
1
0
23 Apr 2024
A Survey of Distributed Graph Algorithms on Massive Graphs
A Survey of Distributed Graph Algorithms on Massive Graphs
Lingkai Meng
Yu Shao
Long Yuan
Longbin Lai
Peng Cheng
Xue Li
Wenyuan Yu
Wenjie Zhang
Xuemin Lin
Jingren Zhou
265
35
0
09 Apr 2024
Agent-based Leader Election, MST, and Beyond
Agent-based Leader Election, MST, and Beyond
A. Kshemkalyani
Manish Kumar
A. R. Molla
Gokarna Sharma
183
11
0
20 Mar 2024
Even-Cycle Detection in the Randomized and Quantum CONGEST Model
Even-Cycle Detection in the Randomized and Quantum CONGEST Model
Pierre Fraigniaud
Mael Luce
F. Magniez
Ioan Todinca
263
11
0
19 Feb 2024
The Complexity of Distributed Approximation of Packing and Covering
  Integer Linear Programs
The Complexity of Distributed Approximation of Packing and Covering Integer Linear ProgramsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023
Yi-Jun Chang
Zeyong Li
194
6
0
02 May 2023
Deterministic Near-Optimal Distributed Listing of Cliques
Deterministic Near-Optimal Distributed Listing of CliquesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022
K. Censor-Hillel
Dean Leitersdorf
David Vulakh
197
11
0
18 May 2022
Distributed Subgraph Finding: Progress and Challenges
Distributed Subgraph Finding: Progress and ChallengesInternational Colloquium on Automata, Languages and Programming (ICALP), 2022
K. Censor-Hillel
216
15
0
13 Mar 2022
Sparse Matrix Multiplication in the Low-Bandwidth Model
Sparse Matrix Multiplication in the Low-Bandwidth ModelACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2022
Chetan Gupta
J. Hirvonen
Janne H. Korhonen
Jan Studený
Jukka Suomela
166
5
0
02 Mar 2022
Quantum Distributed Algorithms for Detection of Cliques
Quantum Distributed Algorithms for Detection of CliquesInformation Technology Convergence and Services (ITCS), 2022
K. Censor-Hillel
Orr Fischer
Franccois Le Gall
Dean Leitersdorf
R. Oshman
GNN
179
29
0
09 Jan 2022
Lower Bounds for Induced Cycle Detection in Distributed Computing
Lower Bounds for Induced Cycle Detection in Distributed Computing
Franccois Le Gall
Masayuki Miyamoto
175
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
275
4
0
14 Sep 2021
Strong-Diameter Network Decomposition
Strong-Diameter Network DecompositionACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021
Yi-Jun Chang
M. Ghaffari
235
15
0
19 Feb 2021
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
Fast Distributed Algorithms for Girth, Cycles and Small SubgraphsInternational Symposium on Distributed Computing (DISC), 2021
K. Censor-Hillel
Orr Fischer
T. Gonen
F. Gall
Dean Leitersdorf
R. Oshman
207
29
0
19 Jan 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm
Minor Sparsifiers and the Distributed Laplacian ParadigmIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020
S. Forster
Gramoz Goranci
Yang P. Liu
Richard Peng
Xiaorui Sun
Mingquan Ye
313
25
0
31 Dec 2020
Tight Distributed Listing of Cliques
Tight Distributed Listing of CliquesACM-SIAM Symposium on Discrete Algorithms (SODA), 2020
K. Censor-Hillel
Yi-Jun Chang
Franccois Le Gall
Dean Leitersdorf
200
22
0
14 Nov 2020
Finding Subgraphs in Highly Dynamic Networks
Finding Subgraphs in Highly Dynamic NetworksACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020
K. Censor-Hillel
V. I. Kolobov
Gregory Schwartzman
164
6
0
17 Sep 2020
Deterministic Distributed Expander Decomposition and Routing with
  Applications in Distributed Derandomization
Deterministic Distributed Expander Decomposition and Routing with Applications in Distributed DerandomizationIEEE Annual Symposium on Foundations of Computer Science (FOCS), 2020
Yi-Jun Chang
Thatchaphol Saranurak
142
39
0
29 Jul 2020
On Distributed Listing of Cliques
On Distributed Listing of CliquesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020
K. Censor-Hillel
F. Gall
Dean Leitersdorf
117
24
0
10 Jul 2020
Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model
Quantum Distributed Algorithm for Triangle Finding in the CONGEST ModelSymposium on Theoretical Aspects of Computer Science (STACS), 2019
Taisuke Izumi
F. Gall
F. Magniez
157
33
0
30 Aug 2019
Distributed Dense Subgraph Detection and Low Outdegree Orientation
Distributed Dense Subgraph Detection and Low Outdegree OrientationInternational Symposium on Distributed Computing (DISC), 2019
Hsin-Hao Su
H. Vu
428
25
0
29 Jul 2019
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in
  the CONGEST-CLIQUE Model
Quantum Distributed Algorithm for the All-Pairs Shortest Path Problem in the CONGEST-CLIQUE ModelACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2019
Taisuke Izumi
F. Gall
158
41
0
06 Jun 2019
Distributed Edge Connectivity in Sublinear Time
Distributed Edge Connectivity in Sublinear Time
Mohit Daga
Monika Henzinger
Danupon Nanongkai
Thatchaphol Saranurak
150
42
0
08 Apr 2019
Detecting cliques in CONGEST networks
Detecting cliques in CONGEST networksDistributed computing (Distrib. Comput.), 2018
A. Czumaj
C. Konrad
185
38
0
03 Jul 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
255
30
0
05 Nov 2017
1
Page 1 of 1