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

–
Coffee and Check-In
–
Part 1: Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness

David Woodruff (Carnegie Mellon University)
–
Lifting Linear Sketches: Optimal Bounds and Adversarial Robustness

Samson Zhou (Texas A&M University)
–
Break
–
Student Talks

Yiqiao Bao (University of Pennsylvania),
Amir Azarmehr (Northeastern),
Janani Sudaresan (University of Waterloo)
–
Lunch
–
Distribution learning with advice (Remote Talk)

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

Shyamal Patel (Columbia),
Guy Blanc (Stanford),
Alma Ghafari (Northeastern)
–
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)
–
Learning-Augmented Streaming Algorithms for Correlation Clustering

Yinhao Dong (University of Science and Technology of China)
–
Coffee and Check-In
–
Relative-error property testing

Rocco Servedio (Columbia University)
–
Talk by

Arsen Vasilyan (UT Austin)
–
Break
–
Student Talks

Justin Chen (Massachusetts Institute of Technology),
Tianqi Yang (Columbia University),
Lily Chung (MIT)
–
Lunch (on your own)
–
Techniques for Adversarially Robust Locality Sensitive Hashing

Krzysztof Onak (Boston University)
–
Testing Grainedness of Discrete Distributions, and applications to Uniformity Testing in the Huge Object model

Clément Canonne (University of Sydney)
–
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)
–
Student Talk: Srikkanth Ramachandran

Srikkanth Ramachandran (UC Davis)
–
Coffee and Check-In
–
Approximately counting and sampling Hamiltonian motifs in sublinear-time (Remote Talk)

Talya Eden (MIT)
–
Graph-Based Algorithms for Diverse Similarity Search

Sepideh Mahabadi (Microsoft Research)
–
Break
–
Talk by

Vipul Arora (UC Berkeley)
–
Student Talk: Uri Meir

Uri Meir (Tel Aviv University)
–
Trivia