@InProceedings{robinson:LIPIcs.DISC.2023.32,
author = {Robinson, Peter},
title = {{Distributed Sketching Lower Bounds for k-Edge Connected Spanning Subgraphs, BFS Trees, and LCL Problems}},
booktitle = {37th International Symposium on Distributed Computing (DISC 2023)},
pages = {32:1--32:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-301-0},
ISSN = {1868-8969},
year = {2023},
volume = {281},
editor = {Oshman, Rotem},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2023.32},
URN = {urn:nbn:de:0030-drops-191589},
doi = {10.4230/LIPIcs.DISC.2023.32},
annote = {Keywords: Distributed graph algorithm, graph sketching, streaming}
}