Atish Das Sarma, Michael Dinitz, Gopal Pandurangan. Efficient computation of distance sketches in distributed networks. In Guy E. Blelloch, Maurice Herlihy, editors, 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012. pages 318-326, ACM, 2012. [doi]
@inproceedings{SarmaDP12,
title = {Efficient computation of distance sketches in distributed networks},
author = {Atish Das Sarma and Michael Dinitz and Gopal Pandurangan},
year = {2012},
doi = {10.1145/2312005.2312060},
url = {http://doi.acm.org/10.1145/2312005.2312060},
researchr = {https://researchr.org/publication/SarmaDP12},
cites = {0},
citedby = {0},
pages = {318-326},
booktitle = {24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012},
editor = {Guy E. Blelloch and Maurice Herlihy},
publisher = {ACM},
isbn = {978-1-4503-1213-4},
}