Theory Seminars

Prophet and Secretary Online Algorithms for Matching in General Graphs

Tight Bounds for Adversarially Robust Streams and Sliding Windows via Difference Estimators

Deterministic Mincut in Almost-Linear Time

Fooling Constant-Depth Threshold Circuits

Improved Analysis of Higher Order Random Walks

New algorithms and lower bounds for all-pairs max flow

Accidental Research: Scalable Algorithms for Graph Automorphism and Canonical Labeling

Approximating the Diameter of a Graph

Fast algorithms for linear programs and bipartite matching via new data structures and interior-point methods

New Analysis of the Factor Refinement Algorithm with Applications

Impartial selection, additive approximation guarantees, and priors

A Unified and Fine-Grained Approach for Light Spanners

Edge-Weighted Online Bipartite Matching

Coloring and Maximum Weight Independent Set of Rectangles

Towards Optimal Separations between Quantum and Randomized Query Complexities

Computational Hardness of Optimal Fair Computation

Aggregating Inconsistent Information in Ranking, Clustering and Phylogenetic Trees

New Techniques for Proving Fine-Grained Average-Case Hardness

Hypergraph k-cut for fixed k in deterministic polynomial time

Non-Adaptive Adaptive Sampling in Turnstile Streams

The Menu-Size of Approximately Optimal Auctions

An Algorithm for Hypergraph k-Cut

Towards a Unified Theory of Matching Sparsifiers

Security Games: Quasi-Regular Sequences, and a new version of TSP

The Complexity of Finding S-factors in Regular Graphs