A randomized algorithm for the joining protocol in dynamic distributed networks
From MaRDI portal
(Redirected from Publication:952446)
Recommendations
- Distributed computation in dynamic networks via random walks
- Fast distributed computation in dynamic networks via random walks
- Distributed computation in dynamic networks
- Information spreading in dynamic networks under oblivious adversaries
- Lower bounds on information dissemination in dynamic networks
Cites work
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 1947767 (Why is no real title available?)
- scientific article; zbMATH DE number 1977111 (Why is no real title available?)
- scientific article; zbMATH DE number 1931795 (Why is no real title available?)
- scientific article; zbMATH DE number 2119648 (Why is no real title available?)
- Analysis of the evolution of peer-to-peer systems
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- Paths in graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Sampling regular graphs and a peer-to-peer network
- The tail of the hypergeometric distribution
- Viceroy, a scalable and dynamic emulation of the butterfly
Cited in
(3)
This page was built for publication: A randomized algorithm for the joining protocol in dynamic distributed networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952446)