Seminars

Approximating the Diameter of a Graph

Accidental Research: Scalable Algorithms for Graph Automorphism and Canonical Labeling

New algorithms and lower bounds for all-pairs max flow

Improved Analysis of Higher Order Random Walks

Fooling Constant-Depth Threshold Circuits

Deterministic Mincut in Almost-Linear Time

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

Prophet and Secretary Online Algorithms for Matching in General Graphs

Adversarial Streaming, Differential Privacy, and Adaptive Data Analysis

Approximation Algorithms and Hardness for Strong Unique Games

(a biased selection of) Recent Developments in Combinatorial Auctions

An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature

Adaptive gradient descent methods for constrained optimization

Approximation Algorithms for Fair Clustering

Information theoretic limits of cardinality estimation: Fisher meets Shannon

Reversing Color Coding

The zero-rate threshold of adversarial bit-deletions is less than 1/2

Negative probabilities: what are they for?

k-Forrelation Optimally Separates Quantum and Classical Query Complexity

The Complexity of Gradient Descent: CLS = PPAD∩PLS

Accelerating Sampling Algorithms via Domain Sparsification

On the Complexity of Consensus-Halving and Necklace Splitting

Fully Dynamic Electrical Flows: Sparse Maxflow Faster Than Goldberg-Rao

Breaking the 2^n barrier for 5-coloring and 6-coloring

18th Annual CSE Graduate Honors Competition

Optimization-friendly generic mechanisms without money.

Arnold Filtser: Clan Embeddings into Trees, and Low Treewidth Graphs

Linear Probing Revisited: Tombstones Mark the Demise of Primary Clustering

APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time

A Characterization of Approximability for Biased CSPs