Faster rumor spreading with multiple calls

DOI10.1007/978-3-642-45030-3_42MaRDI QIDQ2872108zbMATH OpenOpenAlexFDO

Authors Ali Pourmiri, Thomas Sauerwald, Konstantinos Panagiotou

Publication date 14 January 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45030-3_42

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20)

Recommendations

• Faster rumor spreading with multiple calls
• Faster Rumor Spreading: Breaking the logn Barrier
• Randomized rumor spreading revisited
• Breaking the \(\log n\) barrier on rumor spreading
• Social networks spread rumors in sublogarithmic time

Cited in

(5)

• Faster rumor spreading with multiple calls
• Quick Gossiping by Conference Calls
• How to Spread Rumors Fast
• Randomized rumor spreading revisited
• How to Spread a Rumor

This page was built for publication: Faster rumor spreading with multiple calls

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