Distributed computation in dynamic networks via random walks
From MaRDI portal
Publication:2345448
DOI10.1016/J.TCS.2015.02.044zbMATH Open1315.68017OpenAlexW2492815501MaRDI QIDQ2345448FDOQ2345448
Authors: Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan 
Publication date: 22 May 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.02.044
Recommendations
Cites Work
- Asymptotic Enumeration of Spanning Trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Distributed Computing: A Locality-Sensitive Approach
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- Many Random Walks Are Faster Than One
- Distributed computation in dynamic networks
- On the complexity of information spreading in dynamic networks
- Fast Distributed Algorithms for Computing Separable Functions
- Multiple random walks in random regular graphs
- Title not available (Why is that?)
- Flooding time of edge-Markovian evolving graphs
- Distributed random walks
- Universal adaptive self-stabilizing traversal scheme: random walk and reloading wave
- A tight unconditional lower bound on distributed randomwalk computation
- Coordinated consensus in dynamic networks
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Parsimonious flooding in dynamic graphs
- Faster information dissemination in dynamic networks via network coding
- Analyzing network coding gossip made easy
- Towards robust and efficient computation in dynamic peer-to-peer networks
- Fast Byzantine agreement in dynamic networks
- Efficient Information Exchange in the Random Phone-Call Model
- Bounds for algebraic gossip on graphs
- Fast distributed computation in dynamic networks via random walks
- Order optimal information spreading using algebraic gossip
Cited In (21)
- A randomized algorithm for the joining protocol in dynamic distributed networks
- Fast distributed computation in dynamic networks via random walks
- Distributed computation and reconfiguration in actively dynamic networks
- Polynomial anonymous dynamic distributed computing without a unique leader
- Cover time and mixing time of random walks on dynamic graphs
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- A tight unconditional lower bound on distributed randomwalk computation
- Sampling-based algorithm for link prediction in temporal networks
- Efficient distributed random walks with applications
- Fast distributed random walks
- Random walks, heat equation and distributed algorithms
- Polynomial anonymous dynamic distributed computing without a unique leader
- Random Walks on Randomly Evolving Graphs
- Universal adaptive self-stabilizing traversal scheme: random walk and reloading wave
- Distributed random walks
- How to compute times of random walks based distributed algorithms
- Distributed computation in dynamic networks
- Distributed routing of ads and bids through random walks in the IDOS system
- Distributed Computation and Reconfiguration in Actively Dynamic Networks
- Linking the mixing times of random walks on static and dynamic random graphs
- Faster information dissemination in dynamic networks via network coding
This page was built for publication: Distributed computation in dynamic networks via random walks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345448)
