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. 1911.02628
  4. Cited By
Distributed MST: A Smoothed Analysis

Distributed MST: A Smoothed Analysis

6 November 2019
Soumyottam Chatterjee
Gopal Pandurangan
N. Pham
ArXiv (abs)PDFHTML

Papers citing "Distributed MST: A Smoothed Analysis"

17 / 17 papers shown
Title
Maintaining Distributed Data Structures in Dynamic Peer-to-Peer Networks
Maintaining Distributed Data Structures in Dynamic Peer-to-Peer Networks
John Augustine
Antonio Cruciani
Iqra Altaf Gillani
41
1
0
16 Sep 2024
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
Time- and Communication-Efficient Overlay Network Construction via
  Gossip
Time- and Communication-Efficient Overlay Network Construction via Gossip
Fabien Dufoulon
Michael Moorman
W. Moses
Gopal Pandurangan
46
2
0
28 Nov 2023
Smoothed Analysis of Information Spreading in Dynamic Networks
Smoothed Analysis of Information Spreading in Dynamic Networks
M. Dinitz
Jeremy T. Fineman
Seth Gilbert
Calvin C. Newport
42
4
0
11 Aug 2022
Smoothed Analysis of Population Protocols
Smoothed Analysis of Population Protocols
Gregory Schwartzman
Y. Sudo
47
2
0
25 May 2021
Strong-Diameter Network Decomposition
Strong-Diameter Network Decomposition
Yi-Jun Chang
M. Ghaffari
65
15
0
19 Feb 2021
Models of Smoothing in Dynamic Networks
Models of Smoothing in Dynamic Networks
Uri Meir
A. Paz
Gregory Schwartzman
69
4
0
28 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
36
34
0
29 Jul 2020
Fast Approximate Shortest Paths in the Congested Clique
Fast Approximate Shortest Paths in the Congested Clique
K. Censor-Hillel
Michal Dory
Janne H. Korhonen
Dean Leitersdorf
61
54
0
14 Mar 2019
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
45
45
0
12 May 2018
Distributed Symmetry-Breaking Algorithms for Congested Cliques
Distributed Symmetry-Breaking Algorithms for Congested Cliques
Leonid Barenboim
V. Khazanov
41
14
0
20 Feb 2018
MST in O(1) Rounds of the Congested Clique
MST in O(1) Rounds of the Congested Clique
T. Jurdzinski
Krzysztof Nowicki
LRM
58
92
0
26 Jul 2017
Towards a complexity theory for the congested clique
Towards a complexity theory for the congested clique
Janne H. Korhonen
Jukka Suomela
52
43
0
09 May 2017
Smoothed Analysis of Dynamic Networks
Smoothed Analysis of Dynamic Networks
M. Dinitz
Jeremy T. Fineman
Seth Gilbert
Calvin C. Newport
34
19
0
14 Aug 2015
Distributed Random Walks
Distributed Random Walks
Atish Das Sarma
Danupon Nanongkai
Gopal Pandurangan
P. Tetali
151
65
0
19 Feb 2013
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in
  the SINR Model
A Fast Distributed Approximation Algorithm for Minimum Spanning Trees in the SINR Model
Maleq Khan
V. S. Anil Kumar
Gopal Pandurangan
Guanhong Pei
137
109
0
06 Jun 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
114
346
0
12 Nov 2010
1