Quasirandom rumor spreading - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald. Quasirandom rumor spreading. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. pages 773-781, SIAM, 2008. [doi]

The following publications are possibly variants of this publication:

Quasirandom Rumor SpreadingBenjamin Doerr, Tobias Friedrich, Thomas Sauerwald. TALG, 11(2):9, 2014. [doi]

Quasirandom Rumor Spreading on ExpandersBenjamin Doerr, Tobias Friedrich, Thomas Sauerwald. endm, 34:243-247, 2009. [doi]

Tight Bounds for Quasirandom Rumor SpreadingSpyros Angelopoulos, Benjamin Doerr, Anna Huber, Konstantinos Panagiotou. combinatorics, 16(1), 2009. [doi]

Quasirandom rumor spreading: An experimental analysisBenjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald. jea, 16, 2011. [doi]

Quasirandom Rumor Spreading: An Experimental AnalysisBenjamin Doerr, Tobias Friedrich, Marvin Künnemann, Thomas Sauerwald. alenex 2009: 145-153 [doi]

Communication Complexity of Quasirandom Rumor SpreadingPetra Berenbrink, Robert Elsässer, Thomas Sauerwald. algorithmica, 72(2):467-492, 2015. [doi]

Communication Complexity of Quasirandom Rumor SpreadingPetra Berenbrink, Robert Elsässer, Thomas Sauerwald. esa 2010: 134-145 [doi]

Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and RobustnessBenjamin Doerr, Tobias Friedrich, Thomas Sauerwald. icalp 2009: 366-377 [doi]

Rumor spreading and vertex expansionGeorge Giakkoupis, Thomas Sauerwald. soda 2012: 1623-1641 [doi]

runs on WebDSL