• 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
–
Human Computation
Manuel Blum, Carnegie Mellon University
–
Break
–
Explicit Two-Source Extractors and Resilient Functions
David Zuckerman, UT Austin
–
Break
–
On the Power of Gradually Increasing Independence
Parikshit Gopalan, Microsoft Research
–
Lunch
–
Anti-Concentration for Polynomials of Independent Random Variables
Raghu Meka, UCLA
–
Lower Bounds by Birkhoff Interpolation
Pascal Koiran, Ecole Normale Supérieure de Lyon
–
Sublinear Space Complexity
Osamu Watanabe, Tokyo Institute of Technology
–
Reception
–
Coffee and Check-In
–
Chasing Lower Bounds
Avi Wigderson, Institute for Advanced Study, Princeton
–
Break
–
Local Reductions
Emanuele Viola, Northeastern University
–
Break
–
Getting Harder All the Time?
Omer Reingold, Samsung Research America
–
Derandomization via Robust Algebraic Circuit Lower Bounds
Michael Forbes, Princeton University
–
Graph Automorphism and Circuit Size
Eric Allender, Rutgers University 
–
Lunch
–
Open Problems Discussion Session
–
Break
–
Open Problems Discussion Session
–
Coffee and Check-In
–
On the Existence of Optimal Algorithms
Boaz Barak, Microsoft Research and Harvard University 
–
Break
–
A Compression Algorithm for AC^0[p] Circuits Using Certifying Polynomials
Srikanth Srinivasan, Indian Institute of Technology Bombay
–
Break
–
Approaches to Bounding the Exponent of Matrix Multiplication
Chris Umans, California Institute of Technology
–
Lunch
–
Panel (Interactive Discussion)
–
Break
–
Panel (Interactive Discussion)
–
Coffee and Check-In
–
QBF Satisfiability Algorithms and Connections with Circuit Lower Bounds
Rahul Santhanam, University of Edinburgh
–
Break
–
Satisfiability Algorithms for Small Depth Circuits with Symmetric Gates
Suguru Tamaki, Kyoto University
–
Break
–
Probabilistic Polynomials and Hamming Nearest Neighbors
Joshua Alman, Stanford University
–
Lunch
–
Generalizations of the Gate Elimination Method
Alexander Kulikov, St. Petersburg Department of Steklov Institute of Mathematics
–
Addition is Exponentially Harder than Counting for Shallow Monotone Circuits
Igor Oliveira, Columbia University
–
Satisfiability Algorithms Based on Concentrated Shrinkage
Ruiwen Chen, University of Edinburgh