–
Coffee and Check-in
–
Property Testing for Graphs

Artur Czumaj (University of Warwick)
Video
–
Break
–
Testing Boolean Functions

Erik Waingarten (University of Pennsylvania)
Video
–
Lunch (on your own)
–
Counting Subgraphs in Sublinear Time

C. Seshadhri (UC Santa Cruz)
Video
–
Break
–
Sampling Big Ideas in Sublinear Algorithms

Edith Cohen (Tel Aviv University and Google)
Video
–
Reception
–
Coffee and Check-in
–
An Introduction to Distributed, Massively Parallel, and Local Computation Algorithms

Mohsen Ghaffari (Massachusetts Institute of Technology)
Video
–
Break
–
Graph Algorithms in the MPC Model

Slobodan Mitrovic (UC Davis)
Video
–
Lunch (on your own)
–
Conditional Hardness for Massively Parallel Computing (MPC) Via Distributed Lower Bounds

Artur Czumaj (University of Warwick)
Video
–
Break
–
Graph Coloring Through the Sublinear Lens

Sepehr Assadi (University of Waterloo and Rutgers University)
Video
–
Coffee and Check-in
–
An Overview on Data Streams Algorithms

Andrew McGregor (University of Massachusetts Amherst)
Video
–
Break
–
Coresets and Their Applications to Design Sublinear Algorithms

Sepideh Mahabadi (Microsoft Research)
Video
–
Lunch (on your own)
–
New Advances on Multi-Pass Graph Streaming Lower Bounds

Sepehr Assadi (University of Waterloo and Rutgers University)
Video
–
Break
–
Adversarially Robust Streaming Algorithms

Omri Ben-Eliezer (Simons Institute)
Video
–
Coffee and Check-in
–
Distribution Testing: Hypothesis Testing from Very Little (or Very Private) Data

Clément Canonne (University of Sydney)
Video
–
Break
–
Testing Assumptions of Learning Algorithms

Arsen Vasilyan (MIT)
Video
–
Lunch (on your own)
–
Sketching and Randomized Linear Algebra

David Woodruff (Carnegie Mellon University)
Video
–
Break
–
Sublinear Time Algorithms for Estimating Edit Distance

Barna Saha (UC San Diego)
Video