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

–
Coffee and Check-In
–
Opening Remarks
–
Circuit Lower Bounds from Algorithm Design: An Overview I
Ryan Williams (Massachusetts Institute of Technology)
–
Break
–
Circuit Lower Bounds from Algorithm Design: An Overview II
Ryan Williams (Massachusetts Institute of Technology)
–
Lunch
–
Restriction-based Methods I
Benjamin Rossman (University of Toronto)
–
Break
–
Restriction-based Methods II
Benjamin Rossman (University of Toronto)
–
Welcome Reception
–
Coffee and Check-In
–
Lower Bounds Techniques in Proof Complexity I
Pavel Hrubes, Academy of Sciences of the Czech Republic
–
Break
–
Lower Bounds Techniques in Proof Complexity II
Pavel Hrubes, Academy of Sciences of the Czech Republic
–
Lunch
–
Derandomization from Circuit Lower Bounds I
Russell Impagliazzo (UC San Diego)
–
Break
–
Derandomization from Circuit Lower Bounds II
Russell Impagliazzo (UC San Diego)
–
Coffee and Check-In
–
Geometric Complexity Theory: Complexity Lower Bounds Using Algebraic Geometry and Representation Theory I
Christian Ikenmeyer (University of Warwick)
–
Break
–
Geometric Complexity Theory: Complexity Lower Bounds Using Algebraic Geometry and Representation Theory II
Christian Ikenmeyer (University of Warwick)
–
Lunch
–
Lower Bounds in Arithmetic Circuit Complexity I
Srikanth Srinivasan (Indian Institute of Technology Bombay)
–
Break
–
Lower Bounds in Arithmetic Circuit Complexity II
Srikanth Srinivasan (Indian Institute of Technology Bombay)
–
Coffee and Check-In
–
Communication Complexity I
Anup Rao (University of Washington)
–
Break
–
Communication Complexity II
Anup Rao (University of Washington)
–
Lunch
–
Lower Bounds for Dynamic Data Structures I
Kasper Green Larsen (Aarhus University)
–
Break
–
Lower Bounds for Dynamic Data Structures II
Kasper Green Larsen (Aarhus University)
–
Coffee and Check-In
–
Time-Space Lower Bounds for Learning I
Avishay Tal (UC Berkeley)
–
Break
–
Time-Space Lower Bounds for Learning II
Avishay Tal (UC Berkeley)
–
Lunch
–
Impossibility Results for Distributed Computing I
Faith Ellen, University of Toronto
–
Break
–
Impossibility Results for Distributed Computing II
Faith Ellen, University of Toronto