• Click on the titles of individual talks for abstract, slides and archived video (available approximately one week after the conclusion of the workshop).

Please note that this schedule is subject to change. All events take place in the Calvin Lab Auditorium.

–
Coffee & Check-In
–
Opening Remarks
–
Higher Lower Bounds from the 3SUM Conjecture
Seth Pettie, University of Michigan
–
3SUM Hardness of Triangle Enumeration Problems, and their Consequences.
Tsvi Kopelovitz, University of Michigan
–
Break
–
Clustered Integer 3SUM via Additive Combinatorics
Moshe Lewenstein, Bar-Ilan University
–
Lunch
–
3SUM, 3XOR, Triangles
Emanuele Viola, Northeastern University
–
Break
–
The New P
Amir Abboud, Stanford University
–
Reception
–
Coffee & Check-In
–
Playing with Grammars: What Have We Known So Far!
Barna Saha, University of Massachusetts Amherst
–
Lower Bounds and Open Problems in Streams
Raphaël Clifford, University of Bristol
–
Break
–
Optimal Data-Dependent Hashing for Nearest Neighbor Search
Alex Andoni, Columbia University
–
Lunch
–
Conditional Lower Bounds for Longest Common Subsequence
Karl Bringmann, ETH Zürich
–
Fast Combinatorial 3SUM breaks BMM
Kasper Green Larsen, Aarhus University 
–
Break
–
Which Regular Expression Patterns are Hard to Match?
Arturs Backurs, MIT
–
Rump Session
–
Coffee & Check-In
–
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
Fabrizio Grandoni, IDSIA, University of Lugano 
–
Upper and Lower Bounds for Graph Problems in Computer Aided Verification
Monika Henzinger, University of Vienna
–
Break
–
Simulating Branching Programs with Edit Distance and Friends or: A Polylog Shaved is a Lower Bound Made
Amir Abboud, Stanford University
–
Lunch
–
Deterministic APSP, Orthogonal Vectors, and More
Ryan Williams, Stanford University
–
Some Emergency Barriers to Worst-Case Dynamic MST
Danupon Nanongkai, KTH Royal Institute of Technology
–
Break
–
Algorithmic Uses of SETH-Based Lower Bounds
Marvin Künnemann, Max Planck Institut für Informatik
–
Open Problem Session
–
Coffee & Check-In
–
Deterministic Edge Connectivity in Near-Linear Time
Mikkel Thorup, University of Copenhagen
–
Finding k Simple Shortest Paths and Cycles
Vijaya Ramachandran, University of Texas at Austin
–
Break
–
Light Spanners
Shiri Chechik, Tel-Aviv University
–
Lunch
–
Input Sparsity and Hardness for Linear Algebra Problems
David Woodruff, IBM Almaden
–
ETH Hardness for Densest-k-Subgraph with Perfect Completeness
Aviad Rubinstein, UC Berkeley
–
Subquadratic Algorithms for Succinct Stable Matching
Daniel Moeller, UC San Diego
–
Break
–
Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
Josh Wang, Stanford University
–
Orthogonal Vectors is Hard for First-Order Properties on Sparse Graphs
Jiawei Gao, UC San Diego