Bernhard Haeupler, D. Ellis Hershkowitz, David Wajc. Round- and Message-Optimal Distributed Graph Algorithms. In Calvin Newport, Idit Keidar, editors, Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018. pages 119-128, ACM, 2018. [doi]
@inproceedings{HaeuplerHW18,
title = {Round- and Message-Optimal Distributed Graph Algorithms},
author = {Bernhard Haeupler and D. Ellis Hershkowitz and David Wajc},
year = {2018},
doi = {10.1145/3212734.3212737},
url = {https://doi.org/10.1145/3212734.3212737},
researchr = {https://researchr.org/publication/HaeuplerHW18},
cites = {0},
citedby = {0},
pages = {119-128},
booktitle = {Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, PODC 2018, Egham, United Kingdom, July 23-27, 2018},
editor = {Calvin Newport and Idit Keidar},
publisher = {ACM},
}