Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation

Jelani Nelson, Huacheng Yu. Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation. In Timothy M. Chan, editor, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019. pages 1844-1860, SIAM, 2019. [doi]

@inproceedings{NelsonY19,
  title = {Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation},
  author = {Jelani Nelson and Huacheng Yu},
  year = {2019},
  doi = {10.1137/1.9781611975482.111},
  url = {https://doi.org/10.1137/1.9781611975482.111},
  researchr = {https://researchr.org/publication/NelsonY19},
  cites = {0},
  citedby = {0},
  pages = {1844-1860},
  booktitle = {Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019, San Diego, California, USA, January 6-9, 2019},
  editor = {Timothy M. Chan},
  publisher = {SIAM},
  isbn = {978-1-61197-548-2},
}