Low randomness rumor spreading via hashing

DOI10.4230/LIPICS.STACS.2012.314zbMATH Open1245.68020MaRDI QIDQ2904772FDOQ2904772

Authors: George Giakkoupis, Thomas Sauerwald, He Sun, Philipp Woelfel 

Publication date: 23 August 2012

Recommendations

• scientific article; zbMATH DE number 6783407
• Gossip vs. Markov chains, and randomness-efficient rumor spreading
• Quasi-random rumor spreading: reducing randomness can be costly
• Simple, fast and deterministic gossip and rumor spreading
• A time-randomness tradeoff for quasi-random rumour spreading

zbMATH Keywords

parallel and distributed computingrandomnessrumor spreading

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)

Cited In (2)

• Gossip vs. Markov chains, and randomness-efficient rumor spreading
• Rumor spreading with no dependence on conductance

This page was built for publication: Low randomness rumor spreading via hashing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904772)