Oct 11 10:30 am - 11:30 am The polymorphic gateway between structure and algorithms: Constraint Satisfaction and Beyond
Nov 22 10:30 am - 11:30 am Fine-grained hardness of CVP(P)— Everything that we can prove (and nothing else)
Oct 9 10:00 am - 11:00 am Aggregating Inconsistent Information in Ranking, Clustering and Phylogenetic Trees
Oct 23 2:00 pm - 3:00 pm Towards Optimal Separations between Quantum and Randomized Query Complexities
Dec 11 10:00 am - 11:00 am Fast algorithms for linear programs and bipartite matching via new data structures and interior-point methods
Jan 22 10:00 am - 11:00 am Accidental Research: Scalable Algorithms for Graph Automorphism and Canonical Labeling
Feb 26 10:00 am - 11:00 am Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators
Apr 9 10:00 am - 11:00 am An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
Apr 30 10:00 am - 11:00 am Information theoretic limits of cardinality estimation: Fisher meets Shannon
Jan 21 3:00 pm - 4:00 pm Arun Jambulapati: Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers
Apr 8 3:00 pm - 4:00 pm Max Hopkins: Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments
Apr 22 3:00 pm - 4:00 pm Mitali Bafna: Playing Unique Games on Certifiable Small-Set Expanders and High-Dimensional Expanders
Sep 23 3:00 pm - 4:00 pm Fernando Granha Jeronimo: Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
Oct 14 3:00 pm - 4:00 pm Haotian Jiang: Resolving Matrix Spencer Conjecture Up to Polylogarithmic Rank
Oct 21 12:00 pm - 1:00 pm Vincent Cohen-Addad: Sublinear time algorithms for Euclidean clustering coresets and correlation clustering
Oct 21 3:00 pm - 4:00 pm Sorrachai Yingchareonthawornchai: Deterministic Small Vertex Connectivity in Almost Linear Time
Nov 4 3:00 pm - 4:00 pm Aaron Bernstein: Negative-Weight Single-Source Shortest Paths in Near-linear Time
Mar 17 3:00 pm - 4:00 pm Sasha Golovnev: Polynomial formulations as a barrier for reduction-based hardness proofs
Oct 6 2:00 pm - 3:00 pm Lars Rohwedder: Simpler and stronger approximation algorithms for flow time scheduling
Nov 15 3:30 pm - 4:30 pm Deterministic Clustering in High Dimensional Spaces: Sketches and Approximation