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. 1102.2906
  4. Cited By
A Tight Lower Bound on Distributed Random Walk Computation
v1v2 (latest)

A Tight Lower Bound on Distributed Random Walk Computation

14 February 2011
Danupon Nanongkai
Atish Das Sarma
Gopal Pandurangan
    OT
ArXiv (abs)PDFHTML

Papers citing "A Tight Lower Bound on Distributed Random Walk Computation"

15 / 15 papers shown
Title
Smaller Cuts, Higher Lower Bounds
Smaller Cuts, Higher Lower Bounds
Amir Abboud
K. Censor-Hillel
Seri Khoury
A. Paz
49
29
0
07 Jan 2019
Massively Parallel Algorithms for Finding Well-Connected Components in
  Sparse Graphs
Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs
Sepehr Assadi
Xiaorui Sun
Omri Weinstein
52
58
0
08 May 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
80
29
0
05 Nov 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
K. Censor-Hillel
Seri Khoury
A. Paz
75
55
0
16 May 2017
Near-Linear Lower Bounds for Distributed Distance Computations, Even in
  Sparse Networks
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks
Amir Abboud
K. Censor-Hillel
Seri Khoury
45
75
0
17 May 2016
On the Distributed Complexity of Large-Scale Graph Computations
On the Distributed Complexity of Large-Scale Graph Computations
Gopal Pandurangan
Peter Robinson
Michele Scquizzato
86
53
0
26 Feb 2016
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification
Liah Kor
Amos Korman
David Peleg
49
26
0
15 Dec 2015
Near-Optimal Distributed Approximation of Minimum-Weight Connected
  Dominating Set
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set
M. Ghaffari
58
19
0
30 Apr 2014
Distributed Connectivity Decomposition
Distributed Connectivity Decomposition
K. Censor-Hillel
M. Ghaffari
Fabian Kuhn
98
58
0
21 Nov 2013
Distributed Random Walks
Distributed Random Walks
Atish Das Sarma
Danupon Nanongkai
Gopal Pandurangan
P. Tetali
151
65
0
19 Feb 2013
Dense Subgraphs on Dynamic Networks
Dense Subgraphs on Dynamic Networks
Atish Das Sarma
Ashwin Lall
Danupon Nanongkai
Amitabh Trehan
108
21
0
07 Aug 2012
Can Quantum Communication Speed Up Distributed Computation?
Can Quantum Communication Speed Up Distributed Computation?
Michael Elkin
H. Klauck
Danupon Nanongkai
Gopal Pandurangan
116
50
0
22 Jul 2012
Fast Distributed Computation in Dynamic Networks via Random Walks
Fast Distributed Computation in Dynamic Networks via Random Walks
Atish Das Sarma
A. R. Molla
Gopal Pandurangan
84
36
0
24 May 2012
Near-Optimal Random Walk Sampling in Distributed Networks
Near-Optimal Random Walk Sampling in Distributed Networks
Atish Das Sarma
A. R. Molla
Gopal Pandurangan
58
16
0
06 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
114
346
0
12 Nov 2010
1