Huacheng Yu. Tight Distributed Sketching Lower Bound for Connectivity. In Dániel Marx, editor, Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021. pages 1856-1873, SIAM, 2021. [doi]
@inproceedings{Yu21-11, title = {Tight Distributed Sketching Lower Bound for Connectivity}, author = {Huacheng Yu}, year = {2021}, doi = {10.1137/1.9781611976465.111}, url = {https://doi.org/10.1137/1.9781611976465.111}, researchr = {https://researchr.org/publication/Yu21-11}, cites = {0}, citedby = {0}, pages = {1856-1873}, booktitle = {Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021}, editor = {Dániel Marx}, publisher = {SIAM}, isbn = {978-1-61197-646-5}, }