A tight unconditional lower bound on distributed randomwalk computation

DOI10.1145/1993806.1993853zbMath1321.68486OpenAlexW2043522657MaRDI QIDQ2943404

Atish Das Sarma, Gopal Pandurangan, Danupon Nanongkai

Publication date: 11 September 2015

Published in: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1993806.1993853

zbMATH Keywords

lower boundrandom walktime complexitydistributed algorithmscommunication complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15) Random walks on graphs (05C81)

Related Items (8)

Tight bounds for distributed minimum-weight spanning tree verification ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Sampling-based algorithm for link prediction in temporal networks ⋮ Message lower bounds via efficient network synchronization ⋮ Message Lower Bounds via Efficient Network Synchronization ⋮ Pointer chasing via triangular discrimination ⋮ Unnamed Item ⋮ Distributed computation in dynamic networks via random walks

Cites Work

• Unnamed Item
• Gradient clock synchronization in dynamic networks
• Consensus algorithms with one-bit messages
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Broadcasting in dynamic radio networks
• Programming simultaneous actions using common knowledge
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Flooding time in edge-Markovian dynamic graphs
• Knowledge and common knowledge in a distributed environment
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony
• Fault Tolerance in Networks of Bounded Degree
• Reaching Agreement in the Presence of Faults
• Perfectly secure message transmission
• Parsimonious flooding in dynamic graphs
• Optimal gradient clock synchronization in dynamic networks
• Almost-Everywhere Secure Computation

This page was built for publication: A tight unconditional lower bound on distributed randomwalk computation