Michael Elkin. A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners. In Indranil Gupta, Roger Wattenhofer, editors, Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007. pages 185-194, ACM, 2007. [doi]
@inproceedings{Elkin07:0,
title = {A near-optimal distributed fully dynamic algorithm for maintaining sparse spanners},
author = {Michael Elkin},
year = {2007},
doi = {10.1145/1281100.1281128},
url = {http://doi.acm.org/10.1145/1281100.1281128},
researchr = {https://researchr.org/publication/Elkin07%3A0},
cites = {0},
citedby = {0},
pages = {185-194},
booktitle = {Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12-15, 2007},
editor = {Indranil Gupta and Roger Wattenhofer},
publisher = {ACM},
isbn = {978-1-59593-616-5},
}