Peter Robinson. Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners. In Joseph (Seffi) Naor, Niv Buchbinder, editors, Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. pages 2105-2120, SIAM, 2022. [doi]
@inproceedings{Robinson22-0, title = {Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners}, author = {Peter Robinson}, year = {2022}, doi = {10.1137/1.9781611976465.126}, url = {https://doi.org/10.1137/1.9781611976465.126}, researchr = {https://researchr.org/publication/Robinson22-0}, cites = {0}, citedby = {0}, pages = {2105-2120}, booktitle = {Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022}, editor = {Joseph (Seffi) Naor and Niv Buchbinder}, publisher = {SIAM}, isbn = {978-1-61197-707-3}, }