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. 2007.05316
  4. Cited By
On Distributed Listing of Cliques

On Distributed Listing of Cliques

10 July 2020
K. Censor-Hillel
F. Gall
Dean Leitersdorf
ArXiv (abs)PDFHTML

Papers citing "On Distributed Listing of Cliques"

17 / 17 papers shown
Title
Distributed Complexity of $P_k$-freeness: Decision and Certification
Distributed Complexity of PkP_kPk​-freeness: Decision and Certification
Masayuki Miyamoto
49
1
0
27 Oct 2024
Faster Cycle Detection in the Congested Clique
Faster Cycle Detection in the Congested Clique
K. Censor-Hillel
Tomer Even
Virginia Vassilevska Williams
100
0
0
27 Aug 2024
Deterministic Expander Routing: Faster and More Versatile
Deterministic Expander Routing: Faster and More Versatile
Yi-Jun Chang
Shang-En Huang
Hsin-Hao Su
89
3
0
06 May 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
63
0
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
74
15
0
09 Apr 2024
The Complexity of Distributed Approximation of Packing and Covering
  Integer Linear Programs
The Complexity of Distributed Approximation of Packing and Covering Integer Linear Programs
Yi-Jun Chang
Zeyong Li
62
6
0
02 May 2023
Deterministic Near-Optimal Distributed Listing of Cliques
Deterministic Near-Optimal Distributed Listing of Cliques
K. Censor-Hillel
Dean Leitersdorf
David Vulakh
85
9
0
18 May 2022
Narrowing the LOCAL$\unicode{x2013}$CONGEST Gaps in Sparse Networks via
  Expander Decompositions
Narrowing the LOCAL\unicodex2013\unicode{x2013}\unicodex2013CONGEST Gaps in Sparse Networks via Expander Decompositions
Yi-Jun Chang
Hsin-Hao Su
92
10
0
17 May 2022
Distributed Subgraph Finding: Progress and Challenges
Distributed Subgraph Finding: Progress and Challenges
K. Censor-Hillel
56
14
0
13 Mar 2022
Sparse Matrix Multiplication in the Low-Bandwidth Model
Sparse Matrix Multiplication in the Low-Bandwidth Model
Chetan Gupta
J. Hirvonen
Janne H. Korhonen
Jan Studený
Jukka Suomela
43
5
0
02 Mar 2022
Quantum Distributed Algorithms for Detection of Cliques
Quantum Distributed Algorithms for Detection of Cliques
K. Censor-Hillel
Orr Fischer
Franccois Le Gall
Dean Leitersdorf
R. Oshman
GNN
40
26
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
63
6
0
02 Oct 2021
Strong-Diameter Network Decomposition
Strong-Diameter Network Decomposition
Yi-Jun Chang
M. Ghaffari
60
15
0
19 Feb 2021
Near-Optimal Scheduling in the Congested Clique
Near-Optimal Scheduling in the Congested Clique
K. Censor-Hillel
Yannic Maus
Volodymyr Polosukhin
25
1
0
14 Feb 2021
Tight Distributed Listing of Cliques
Tight Distributed Listing of Cliques
K. Censor-Hillel
Yi-Jun Chang
Franccois Le Gall
Dean Leitersdorf
63
21
0
14 Nov 2020
Finding Subgraphs in Highly Dynamic Networks
Finding Subgraphs in Highly Dynamic Networks
K. Censor-Hillel
V. I. Kolobov
Gregory Schwartzman
23
5
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 Derandomization
Yi-Jun Chang
Thatchaphol Saranurak
33
34
0
29 Jul 2020
1