Practical Graph Algorithms: Scalability and Privacy
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=cV0K-1bsUYc
Quanquan Liu (Simons Institute)
https://simons.berkeley.edu/talks/quanquan-liu-simons-institute-2023-09-08
Meet the Fellows Welcome Event Fall 2023
In this short talk, I'll discuss my research on practical graph algorithms including scalable algorithms for problems that scale to hundreds of billions of edges and differentially private algorithms that allow for stronger guarantees for users beyond scalability. I'll briefly outline some specific aspects of data structures that make them more conducive to being practically efficient on real-world datasets.
Other Videos By Simons Institute for the Theory of Computing
Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Meet the Fellows Welcome Event Fall 2023
Quanquan Liu