Optimal Lower Bounds for Distributed and Streaming Spanning Forest Computation

Published on ● Video Link: https://www.youtube.com/watch?v=ddGYepMRCrc



Duration: 29:39
692 views
5


Huacheng Yu (Harvard University)
https://simons.berkeley.edu/talks/optimal-lower-bounds-distributed-and-streaming-spanning-forest-computation
Interactive Complexity







Tags:
Interactive Complexity
Huacheng Yu
Simons Institute
Theory of Computing
Theory of Computation
Theoretical Computer Science
Computer Science
UC Berkeley