scientific article

zbMath1192.90024arXiv1012.5351MaRDI QIDQ3579453

Tobias Friedrich, Thomas Sauerwald, Benjamin Doerr

Publication date: 6 August 2010

Full work available at URL: https://arxiv.org/abs/1012.5351

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Related Items (26)

The Range of a Rotor Walk ⋮ Deterministic Random Walks for Rapidly Mixing Chains ⋮ Randomised broadcasting: memory vs. randomness ⋮ Messy broadcasting - decentralized broadcast schemes with limited knowledge ⋮ Quasi-random rumor spreading: reducing randomness can be costly ⋮ Rumor Spreading with No Dependence on Conductance ⋮ Randomized Rumour Spreading: The Effect of the Network Topology ⋮ Spreading of messages in random graphs ⋮ Direction-reversing quasi-random rumor spreading with restarts ⋮ Order optimal information spreading using algebraic gossip ⋮ Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ The worst case behavior of randomized gossip protocols ⋮ Asymptotically Optimal Randomized Rumor Spreading ⋮ Unbounded Discrepancy of Deterministic Random Walks on Grids ⋮ Rumor spreading in social networks ⋮ Unnamed Item ⋮ Abelian Networks I. Foundations and Examples ⋮ Fast Simulation of Large-Scale Growth Models ⋮ Introducing Quasirandomness to Computer Science ⋮ Spreading messages ⋮ Breaking the \(\log n\) barrier on rumor spreading ⋮ 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 ⋮ Communication complexity of quasirandom rumor spreading

This page was built for publication: