All talks are presented in Pacific Time. Schedule is subject to change.

–
Coffee and Check-in
–
Opening Remarks
–
Explicit Orthogonal and Unitary Designs
Ryan O'Donnell (Carnegie Mellon University)
–
Break
–
Reverse Hypercotractivity and Improved Sampling in High Dimensional Expanders
Yotam Dikstein (Weizmann Institute of Science)
–
Lunch
–
Hypercontractivity Inequality on $\varepsilon$-product Spaces
Siqi Liu (UC Berkeley)
–
Break
–
Explicit SoS Lower Bounds from (Small-Set) High Dimensional Expanders
Max Hopkins (UC San Diego)
–
Reception
–
Coffee and Check-in
–
Product Mixing, Quantum Separation, and Comfortable Juntas
Noam Lifshitz (Hebrew University)
–
Break
–
Small-Set Expansion in the 2-Degree Short-Code Graph, the Easier Version
Guy Kindler (Hebrew University of Jerusalem)
–
Lunch
–
Optimally Testing Reed Muller Codes via Global Hypercontractivity*
Kai Zheng (MIT)
–
Break
–
Unique Games and Expansion
Mitali Bafna (Carnegie Mellon University)
–
Coffee and Check-in
–
Parallel Discrete Sampling via Continuous Walks
Nima Anari (Stanford University)
–
Break
–
Strong Bounds for 3-Progressions
Zander Kelley (University of Illinois Urbana-Champaign)
–
Lunch
–
Fractional Pseudorandom Generators
Pooya Hatami (Ohio State University)
–
Break
–
Richard M. Karp Distinguished Lecture by Jacob Fox
–
Coffee and Check-in
–
Noise Stability - Beyond the Boolean cube
Dan Mikulincer (MIT)
–
Break
–
Separating Quantum from Classical with k-fold Forrelation and Friends
Makrand Sinha (Simons Institute)
–
Lunch
–
It ain't over till it's over
Pei Wu (Institute for Advanced Study)
–
Break
–
Sparsifying Sums of Norms
Yang Liu (LBNL)
–
Coffee and Check-in
–
Linearity Testing over the Biased Cube
Amey Bhangale (The Weizmann Institute of Science)
–
Break
–
Localization Schemes
Yuansi Chen (Duke University)
–
Lunch
–
On Perfectly Friendly Bisections of Random Graphs
Mehtaab Sawhney (MIT)
–
Break
–
Representation Theory in TCS and Extremal Combinatorics
Nathan Lindzey (Technion - Israel Institute of Technology)