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. 1805.04764
  4. Cited By
New Distributed Algorithms in Almost Mixing Time via Transformations
  from Parallel Algorithms

New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms

12 May 2018
M. Ghaffari
Jason Li
ArXiv (abs)PDFHTML

Papers citing "New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms"

17 / 17 papers shown
Title
Deterministic Expander Routing: Faster and More Versatile
Deterministic Expander Routing: Faster and More Versatile
Yi-Jun Chang
Shang-En Huang
Hsin-Hao Su
94
3
0
06 May 2024
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
99
10
0
17 May 2022
Distributed Subgraph Finding: Progress and Challenges
Distributed Subgraph Finding: Progress and Challenges
K. Censor-Hillel
65
14
0
13 Mar 2022
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
Naoki Kitamura
Taisuke Izumi
60
5
0
25 Apr 2021
Strong-Diameter Network Decomposition
Strong-Diameter Network Decomposition
Yi-Jun Chang
M. Ghaffari
65
15
0
19 Feb 2021
Tight Distributed Listing of Cliques
Tight Distributed Listing of Cliques
K. Censor-Hillel
Yi-Jun Chang
Franccois Le Gall
Dean Leitersdorf
68
21
0
14 Nov 2020
Low-Congestion Shortcuts for Graphs Excluding Dense Minors
Low-Congestion Shortcuts for Graphs Excluding Dense Minors
M. Ghaffari
Bernhard Haeupler
36
25
0
07 Aug 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
36
34
0
29 Jul 2020
On Distributed Listing of Cliques
On Distributed Listing of Cliques
K. Censor-Hillel
F. Gall
Dean Leitersdorf
44
24
0
10 Jul 2020
Distributed MST: A Smoothed Analysis
Distributed MST: A Smoothed Analysis
Soumyottam Chatterjee
Gopal Pandurangan
N. Pham
56
10
0
06 Nov 2019
Low-Congestion Shortcut and Graph Parameters
Low-Congestion Shortcut and Graph Parameters
Naoki Kitamura
Hirotaka Kitagawa
Y. Otachi
Taisuke Izumi
37
9
0
26 Aug 2019
Distributed Data Summarization in Well-Connected Networks
Distributed Data Summarization in Well-Connected Networks
Hsin-Hao Su
H. Vu
40
2
0
01 Aug 2019
Improved Distributed Approximations for Minimum-Weight
  Two-Edge-Connected Spanning Subgraph
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
Michal Dory
M. Ghaffari
66
17
0
26 May 2019
Hardness of Distributed Optimization
Hardness of Distributed Optimization
Nir Bachrach
K. Censor-Hillel
Michal Dory
Yuval Efron
Dean Leitersdorf
A. Paz
56
41
0
24 May 2019
Improved Distributed Expander Decomposition and Nearly Optimal Triangle
  Enumeration
Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
Yi-Jun Chang
Thatchaphol Saranurak
52
51
0
17 Apr 2019
Distributed Triangle Detection via Expander Decomposition
Distributed Triangle Detection via Expander Decomposition
Yi-Jun Chang
Seth Pettie
Hengjie Zhang
56
47
0
17 Jul 2018
A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs
  in O(log n) Time
A Distributed Algorithm for Finding Hamiltonian Cycles in Random Graphs in O(log n) Time
V. Turau
24
6
0
17 May 2018
1