Seminars

Events for 2022

Vera Traub: Better-Than-2 Approximations for Weighted Tree Augmentation

Vera Traub, ETH Zurich

Arun Jambulapati: Ultrasparse Ultrasparsifiers and Faster Laplacian System Solvers

Ce Jin: Fast Low-Space Algorithms for Subset Sum

Michael Dinitz: Faster Matchings via Learned Duals

Michael Dinitz, Johns Hopkins University

Deeksha Adil: Fast Algorithms for l_p-Regression and Other Problems

Deeksha Adil, University of Toronto

Robert Robere: Pseudorandom Self-Reductions for NP-Complete Problems

Robert Robere, Prof., McGill University

Santhoshini Velusamy: Approximating CSPs in the streaming setting

Santhoshini Velusamy, Harvard University

Ryan Williams: Constructive Separations and Their Consequences

Ryan Williams, Prof., MIT

Distinguished Lecture

Algorithms: A Random Walk

Nikhil Bansal, Patrick C. Fischer Professor of Theoretical Computer Science, University of Michigan

Max Hopkins: Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments

Max Hopkins, UCSD

Huacheng Yu: TBD

Huacheng Yu, Princeton University

Parth Mittal: Brooks’ Theorem in Graph Streams

Parth Mittal, Rutgers University

Mitali Bafna: Playing Unique Games on Certifiable Small-Set Expanders and High-Dimensional Expanders

Mitali Bafna, Harvard University

Dissertation Defense

Dynamic Connectivity, Hopsets, and Byzantine Agreement

Haotian Jiang: Minimizing Convex Functions with Integral/Rational Minimizers

Fernando Granha Jeronimo: Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification

Fernando Granha Jeronimo, IAS

Zeyu Guo: Fast Multivariate Multipoint Evaluation over All Finite Fields

Zeyu Guo, Ohio State University

Haotian Jiang: Resolving Matrix Spencer Conjecture Up to Polylogarithmic Rank

Haotian Jiang, University of Washington

Vincent Cohen-Addad: Sublinear time algorithms for Euclidean clustering coresets and correlation clustering

Sorrachai Yingchareonthawornchai: Deterministic Small Vertex Connectivity in Almost Linear Time

Sorrachai Yingchareonthawornchai, Aalto University

Aaron Bernstein: Negative-Weight Single-Source Shortest Paths in Near-linear Time

Aaron Berstein, Rutgers University

Yang Liu: Lessons on Algorithmic Graph Theory from Maxflow

Yang P. Liu, Stanford University

Jessica Sorrell: Replicability in Learning

Jessical Sorrell, University of Pennsylvania

William Hoza: Recent Progress on Derandomizing Space-Bounded Computation

William Hoza, UC Berkeley

DNA Punch-Cards: Implementations and Coding-Theoretic Questions

Olgica Milenkovic, Franklin W. Woeltge Professor of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign

2025 2024 2023 2022 2021 2020 2019