Low Randomness Rumor Spreading via Hashing

Giakkoupis, George; Sauerwald, Thomas; Sun, He; Woelfel, Philipp

doi:10.4230/LIPIcs.STACS.2012.314

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Low Randomness Rumor Spreading via Hashing

MPS-Authors

/persons/resource/persons45356

Sauerwald, Thomas
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45576

Sun, He
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2012/3441/
(Any fulltext)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Giakkoupis, G., Sauerwald, T., Sun, H., & Woelfel, P. (2012). Low Randomness Rumor Spreading via Hashing. In C. Dürr, & T. Wilke (Eds.), 29th International Symposium on Theoretical Aspects of Computer Science: STACS'12 (pp. 314-325). Dagstuhl: Schloss Dagstuhl/ Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.STACS.2012.314.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-F74F-8

Abstract

There is no abstract available