New Advances on Multi-Pass Graph Streaming Lower Bounds

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=57SOq_ivN4I


Duration: 1:04:56
190 views
1

Sepehr Assadi (University of Waterloo and Rutgers University)
https://simons.berkeley.edu/talks/sepehr-assadi-university-waterloo-rutgers-university-2024-05-23
Sublinear Algorithms Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2024-06-18Characterizing the impact of noise on neural computation
2024-06-18Neural computations for geometric reasoning
2024-06-13What is the right "token" for next-token visual prediction?
2024-06-13Combining innate concepts with learning to perceive the world
2024-06-13Toward a Theory of Perspective Perception in Pictures
2024-05-29Distribution Testing: Hypothesis Testing from Very Little (or Very Private) Data
2024-05-29Sublinear Time Algorithms for Estimating Edit Distance
2024-05-29Sketching and Randomized Linear Algebra
2024-05-29Testing Assumptions of Learning Algorithms
2024-05-29Adversarially Robust Streaming Algorithms
2024-05-29New Advances on Multi-Pass Graph Streaming Lower Bounds
2024-05-29Coresets and Their Applications to Design Sublinear Algorithms
2024-05-29An Overview on Data Streams Algorithms
2024-05-29Graph Coloring Through the Sublinear Lens
2024-05-29Conditional Hardness for Massively Parallel Computing (MPC) Via Distributed Lower Bounds
2024-05-29Graph Algorithms in the MPC Model
2024-05-29An Introduction to Distributed, Massively Parallel, and Local Computation Algorithms
2024-05-29Sampling Big Ideas in Sublinear Algorithms
2024-05-29Counting Subgraphs in Sublinear Time
2024-05-29Testing Boolean Functions
2024-05-29Property Testing for Graphs


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Sublinear Algorithms Boot Camp
Sepehr Assadi