YoVDO

New Advances on Multi-Pass Graph Streaming Lower Bounds

Offered By: Simons Institute via YouTube

Tags

Theoretical Computer Science Courses Graph Theory Courses Data Structures Courses Sublinear Algorithms Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore cutting-edge research on multi-pass graph streaming lower bounds in this lecture by Sepehr Assadi from the University of Waterloo and Rutgers University. Delve into the latest advancements and theoretical insights in the field of sublinear algorithms, focusing on graph streaming techniques. Gain a deeper understanding of the challenges and limitations in processing large-scale graph data with limited memory and multiple passes. Learn about new methodologies and approaches that push the boundaries of what's possible in graph streaming algorithms.

Syllabus

New Advances on Multi-Pass Graph Streaming Lower Bounds


Taught by

Simons Institute

Related Courses

Sampling-Based Sublinear Low-Rank Matrix Arithmetic Framework for Dequantizing Quantum Machine Learning
Association for Computing Machinery (ACM) via YouTube
Sublinear Algorithms for Gap Edit Distance
IEEE via YouTube
High Dimensional Robust Sparse Regression
Simons Institute via YouTube
Learning-Augmented Sketches for Frequency Estimation
Simons Institute via YouTube
Adaptive Sparse Recovery with Limited Adaptivity
Simons Institute via YouTube