Distributed computation in dynamic networks via random walks
From MaRDI portal
Publication:2345448
Recommendations
Cites work
- A tight unconditional lower bound on distributed randomwalk computation
- Analyzing network coding gossip made easy
- Asymptotic Enumeration of Spanning Trees
- Bounds for algebraic gossip on graphs
- Coordinated consensus in dynamic networks
- Distributed computation in dynamic networks
- Distributed Computing: A Locality-Sensitive Approach
- Distributed random walks
- Efficient Information Exchange in the Random Phone-Call Model
- Fast Byzantine agreement in dynamic networks
- Fast Distributed Algorithms for Computing Separable Functions
- Fast distributed computation in dynamic networks via random walks
- Faster information dissemination in dynamic networks via network coding
- Flooding time of edge-Markovian evolving graphs
- How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 5454271 (Why is no real title available?)
- scientific article; zbMATH DE number 732976 (Why is no real title available?)
- Many Random Walks Are Faster Than One
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Multiple random walks in random regular graphs
- On the complexity of information spreading in dynamic networks
- Order optimal information spreading using algebraic gossip
- Parsimonious flooding in dynamic graphs
- Towards robust and efficient computation in dynamic peer-to-peer networks
- Universal adaptive self-stabilizing traversal scheme: random walk and reloading wave
Cited in
(25)- Random walks, heat equation and distributed algorithms
- Linking the mixing times of random walks on static and dynamic random graphs
- Distributed computation and reconfiguration in actively dynamic networks
- Polynomial anonymous dynamic distributed computing without a unique leader
- Sampling-based algorithm for link prediction in temporal networks
- Distributed computation in dynamic networks
- A tight unconditional lower bound on distributed randomwalk computation
- Faster information dissemination in dynamic networks via network coding
- Universal adaptive self-stabilizing traversal scheme: random walk and reloading wave
- Cover time and mixing time of random walks on dynamic graphs
- Fast distributed computation in dynamic networks via random walks
- Polynomial anonymous dynamic distributed computing without a unique leader
- Random Walks on Randomly Evolving Graphs
- Fast distributed random walks
- Efficient distributed random walks with applications
- Distributed random walks
- How to compute times of random walks based distributed algorithms
- Distributed Computation and Reconfiguration in Actively Dynamic Networks
- Distributed routing of ads and bids through random walks in the IDOS system
- Fully dynamic sequential and distributed algorithms for MAX-CUT
- Anonymous adversarial dynamic networks with logarithmic memory and communication
- Fraud detection for random walks
- Towards communication-efficient Peer-to-Peer networks
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- A randomized algorithm for the joining protocol in dynamic distributed networks
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)
