scientific article; zbMATH DE number 6783407

MaRDI QIDQ5365055zbMATH OpenFDO

Authors George Giakkoupis, Philipp Woelfel

Publication date 29 September 2017

Full work available at URL http://dl.acm.org/citation.cfm?id=2133072

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Randomized rumor spreading revisited
• Robustness of randomized rumour spreading
• scientific article; zbMATH DE number 7525473
• Quasi-random rumor spreading: reducing randomness can be costly
• Quasirandom Rumor Spreading: An Experimental Analysis
• A time-randomness tradeoff for quasi-random rumour spreading
• Quasirandom rumor spreading, an experimental analysis
• Tight bounds for quasirandom rumor spreading
• Asymptotically optimal randomized rumor spreading
• Asymptotically optimal randomized rumor spreading

Cited in

(14)

• Randomness vs. time in anonymous networks
• Quasi-random rumor spreading: reducing randomness can be costly
• Tight bounds for quasirandom rumor spreading
• Finding rumor sources on random trees
• A time-randomness tradeoff for quasi-random rumour spreading
• Simple and optimal randomized fault-tolerant rumor spreading
• Low randomness rumor spreading via hashing
• Rumor spreading with no dependence on conductance
• The worst case behavior of randomized gossip protocols
• scientific article; zbMATH DE number 7525473 (Why is no real title available?)
• Randomized rumor spreading revisited
• Quasirandom Rumor Spreading: An Experimental Analysis
• Gossip vs. Markov chains, and randomness-efficient rumor spreading
• Early adapting to trends: self-stabilizing information spread using passive communication

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 Q5365055)