All talks listed in Pacific Time. Schedule subject to change.

–
Coffee and Check-In
–
An Alternate Proof of Kager's Cut Counting Bound
Yu Chen (EPFL)
–
Streaming CSPs
Santhoshini Velusamy (Toyota Technological Institute at Chicago)
–
On Testing and Learning Convex Sets
Shivam Nadimpalli (MIT)
–
Break
–
Sublinear Time Algorithms for Estimating Maximum Matching Size
Soheil Behnezhad (Northeastern University)
–
Hyperefficient Communication
Nathan Harms (EPFL)
–
Statistical inference in the presence of practical constraints
Maryam Aliakbarpour (Simons/Rice University)