• 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
–
Satisfiability Algorithms I
Mohan Paturi, UC San Diego
–
Break
–
Satisfiability Algorithms II
Mohan Paturi, UC San Diego
–
Lunch
–
Sparsification Lemma and ETH
Mohan Paturi, UC San Diego
–
Break
–
Exponential-Time Algorithms
Thore Husfeldt, IT University of Copenhagen
–
Coffee and Check-In
–
Computational Complexity of Polynomial Time Problems: Introduction
Virginia Vassilevska Williams, Stanford University 
–
Break
–
Boolean Hardness to Randomization
Russell Impagliazzo, UC San Diego
–
Lunch
–
Circuit Analysis Algorithms
Ryan Williams, Stanford University
–
Break
–
Recent Advances in FPT and Exact Algorithms for NP-Complete Problems
Dániel Marx, Hungarian Academy of Sciences
–
Coffee and Check-In
–
Hardness for Graph Problems - Reductions Based on APSP and SETH
Virginia Vassilevska Williams, Stanford University 
–
Break
–
Derandomization to Boolean Circuit Lower Bounds
Russell Impagliazzo, UC San Diego
–
Lunch
–
Circuit Complexity and Connections I
Ryan Williams, Stanford University
–
Break
–
Parameterized Reductions
Dániel Marx, Hungarian Academy of Sciences 
–
Coffee and Check-In
–
The Easy Witness Lemma
Russell Impagliazzo, UC San Diego
–
Break
–
Circuit Complexity and Connections II
Ryan Williams, Stanford University
–
Lunch
–
Hardness for Sequence Problems - LCS and Frechet Distance
Virginia Vassilevska Williams, Stanford University 
–
Break
–
Consequences of ETH: Tight Bounds for Various Problems
Dániel Marx, Hungarian Academy of Sciences 
–
Coffee and Check-In
–
Proof of NEXP Not in ACC
Ryan Williams, Stanford University
–
Break
–
Hardness for Dynamic Problems; Conclusion and Future Research
Virginia Vassilevska Williams, Stanford University 
–
Lunch
–
Connections Between Hardness and Randomness in the Algebraic Setting
Russell Impagliazzo, UC San Diego
–
Break
–
Consequences of SETH: Tight Bounds for Some More Problems
Dániel Marx, Hungarian Academy of Sciences