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

–
Coffee and Check-In
–
Talk by
David Woodruff (Carnegie Mellon University)
–
Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness
Samson Zhou (Texas A&M University)
–
Break
–
Student Talks
–
Lunch
–
Distribution learning with advice
Arnab Bhattacharyya (University of Warwick)
–
Sublinear Algorithms for Estimating Single-Linkage Clustering Costs
Pan Peng (University of Science and Technology of China)
–
Break
–
Talk by
Shivam Nadimpalli (MIT)
–
Reception
–
Coffee and Check-In
–
Vizing's Theorem in Near-Linear Time
Soheil Behnezhad (Northeastern University)
–
Monotonicity Testing of High-Dimensional Distributions with Subcube Conditioning
Erik Waingarten (University of Pennsylvania)
–
Break
–
Student Talks
–
Lunch (on your own)
–
Leveraging Predictions for Efficient Hypothesis Testing of Discrete Distributions
Maryam Aliakbarpour (Rice University)
–
Talk by
Artur Czumaj (University of Warwick)
–
Break
–
Talk by
Shweta Jain (University of Utah)
–
Learning-Augmented Streaming Algorithms for Approximating Max-Cut
Ali Vakilian (TTIC)
–
Coffee and Check-In
–
Relative-error property testing
Rocco Servedio (Columbia University)
–
Talk by
Arsen Vasilyan (UT Austin)
–
Break
–
Student Talks
–
Lunch (on your own)
–
Techniques for Adversarially Robust Locality Sensitive Hashing
Krzysztof Onak (Boston University)
–
Approximately counting and sampling Hamiltonian motifs in sublinear-time
Talya Eden (MIT)
–
Break
–
Local Computation Algorithm for Set Cover via Retroactive Updates
Slobodan Mitrovic (UC Davis)
–
Sensitivity Lower Bounds for Approximation Algorithms
Yuichi Yoshida (National Institute of Informatics)
–
Coffee and Check-In
–
Talk by
TBD TBD ()
–
Talk by
Sepideh Mahabadi (Microsoft Research)
–
Break
–
Talk by
Vipul Arora (UC Berkeley)
–
Trivia