Robert Elsässer. On the communication complexity of randomized broadcasting in random-like graphs. In Phillip B. Gibbons, Uzi Vishkin, editors, SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006. pages 148-157, ACM, 2006. [doi]
@inproceedings{Elsasser06:0,
title = {On the communication complexity of randomized broadcasting in random-like graphs},
author = {Robert Elsässer},
year = {2006},
doi = {10.1145/1148109.1148135},
url = {http://doi.acm.org/10.1145/1148109.1148135},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/Elsasser06%3A0},
cites = {0},
citedby = {0},
pages = {148-157},
booktitle = {SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallel Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30 - August 2, 2006},
editor = {Phillip B. Gibbons and Uzi Vishkin},
publisher = {ACM},
isbn = {1-59593-452-9},
}