• Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

–
Coffee and Check-In
–
Opening Remarks
–
Approximation Resistance from Pairwise Independent Subgroups
Siu On Chan, UC Berkeley
–
Questions/Discussion/Break
–
An Analytic Approach to Parallel Repetition
David Steurer (Cornell University)
–
Questions/Discussion/Break
–
Hardness of Maximum Independent Set in Structured Hypergraphs
Rishi Saket, IBM T.J. Watson Research Center
–
Questions/Discussion
–
Lunch Break
–
Approximation Algorithms For Projection Games
Dana Moshkovitz, Massachusetts Institute of Technology
–
Questions/Discussion/Break
–
The Complexity of Somewhat Approximation Resistant Predicates
Pratik Worah, Courant Institute, NYU
–
Questions/Discussion/Break
–
A Characterization of Strong Approximation Resistance
Madhur Tulsiani (TTI-Chicago)
–
Questions/Discussion/Break
–
Beyond Locality-Sensitive Hashing
Alex Andoni (Columbia University)
–
Coffee and Check-In
–
Robust Gaussian Noise Stability
Joe Neeman (University of Texas, Austin)
–
Questions/Discussion/Break
–
Majority is Stablest: Discrete and SOS
Elchanan Mossel (Massachusetts Institute of Technology)
–
Questions/Discussion/Break
–
Generalizations of the KKL Theorem and Friedgut's Junta Theorem
Sushant Sachdeva (University of Toronto)
–
Questions/Discussion
–
Lunch Break
–
Testing Surface Area
Ryan O'Donnell, Carnegie Mellon University
–
Questions/Discussion/Break
–
The Analysis of Partially Symmetric Functions
Eric Blais, Massachusetts Institute of Technology
–
Questions/Discussion/Break
–
Open Problem Session
–
Coffee and Check-In
–
Approximate Constraint Satisfaction Requires Large LP Relaxations
James Lee (University of Washington)
–
Questions/Discussion/Break
–
Moment-Matching Polynomials
Adam Klivans (University of Texas, Austin)
–
Questions/Discussion/Break
–
Deterministic Approximate Counting for Degree-2 Polynomial Threshold Functions
Rocco Servedio (Columbia University)
–
Questions/Discussion
–
Lunch Break
–
Deterministic Counting of Satisfying Assignments for Juntas of Degree-2 PTFs
Anindya De (Northwestern University)
–
Questions/Discussion/Break
–
Approximating Boolean Functions With Small-Depth Circuits
Li-Yang Tan, Columbia University
–
Questions/Discussion/Break
–
Open Problem Session
–
Reception
–
Coffee and Check-In
–
Testing for Affine Invariant Properties of Algebraic Functions
Hamed Hatami (McGill University)
–
Questions/Discussion/Break
–
On the Structure of Boolean Functions With Small Spectral Norm
Ben Lee Volk, Technion Israel Institute of Technology
–
Questions/Discussion/Break
–
Locally Testable Codes and Cayley Graphs
Parikshit Gopalan, Microsoft Research
–
Questions/Discussion
–
Lunch Break
–
Local Combinatorics, Or: What To Do With All Those Gigantic Graphs?
Nati Linial (Hebrew University of Jerusalem)
–
Questions/Discussion/Break
–
Agnostic Learning Over Permutation Invariant Distributions
Karl Wimmer (Duquesne University)
–
Coffee and Check-In
–
Association Schemes, Non-Commutative Polynomials and Lasserre Lower Bounds for Planted Clique
Raghu Meka, Microsoft Research
–
Questions/Discussion/Break
–
Fourier PCA
Ying Xiao, Georgia Institute of Technology
–
Questions/Discussion/Break
–
MCMC Learning
Varun Kanade (UC Berkeley)