Seminars

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

17th Annual CSE GRADUATE HONORS COMPETITION

Algebraic Frameworks for Cryptographic Primitives

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

Efficiency in Machine Learning with Focus on Deep Learning and Recommender Systems

Towards the First Practical Applications of Quantum Computers

A Parallel Tensor Network Contraction Algorithm and Its Applications in Quantum Computation

An Algorithm for Hypergraph k-Cut

Learning from Societal Data: Theory and Practice

Algorithmic Paradigms for Dynamic Graphs

Towards a Unified Theory of Matching Sparsifiers

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