Theory of Computation Seminars

Liren Shan: Higher-Order Cheeger Inequality for Partitioning with Buffers

Sophie Huiberts: Smoothed analysis of the simplex method

Manik Dhar: ℓ∞ linear hashing and two-sided Kakeya bounds

Min Jae Song: Continuous LWE

Sasha Golovnev: Polynomial formulations as a barrier for reduction-based hardness proofs

Or Zamir: Algorithmic Applications of Hypergraph and Partition Containers

Zihan Tan: Almost-Optimal Sublinear Additive Spanners

Lars Rohwedder: Simpler and stronger approximation algorithms for flow time scheduling

Victor Reis: Optimal Online Discrepancy Minimization

Deeparnab Chakrabarty: Parallel Submodular Function Minimization

Are there graphs whose shortest path structure requires large edge weights?

Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation

Separating MAX 2-AND, MAX DI-CUT and MAX CUT

Gaussian Polytope Approximators