scientific article; zbMATH DE number 5764860
From MaRDI portal
Publication:3579453
Cited in
(25)- Spreading messages
- On linear-time data dissemination in dynamic rooted trees
- Quasi-random rumor spreading: reducing randomness can be costly
- Breaking the \(\log n\) barrier on rumor spreading
- Communication complexity of quasirandom rumor spreading
- Direction-reversing quasi-random rumor spreading with restarts
- Abelian networks. I: Foundations and examples
- Quasirandom rumor spreading on expanders
- A time-randomness tradeoff for quasi-random rumour spreading
- Quasirandom broadcasting on the complete graph is as fast as randomized broadcasting
- Asymptotically optimal randomized rumor spreading
- Rumor spreading with no dependence on conductance
- Asymptotically optimal randomized rumor spreading
- Introducing Quasirandomness to Computer Science
- Randomised broadcasting: memory vs. randomness
- The range of a rotor walk
- Deterministic random walks for rapidly mixing chains
- Unbounded discrepancy of deterministic random walks on grids
- The worst case behavior of randomized gossip protocols
- Randomized rumour spreading: the effect of the network topology
- Rumor spreading in social networks
- Order optimal information spreading using algebraic gossip
- Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
- Messy broadcasting - decentralized broadcast schemes with limited knowledge
- Spreading of messages in random graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579453)
