Computational Complexity Courses
Simons Institute via YouTube Subgraph Counting and Seed Counting in Graph Theory
Simons Institute via YouTube Testing Intersectingness of Uniform Families - How Dana and I Intersected
Simons Institute via YouTube Maximal Matching in Bounded-deletion Streams
Simons Institute via YouTube Graphs with Large Edge Weights for Shortest Path Structure - Sublinear Graph Simplification
Simons Institute via YouTube Sparsifying Set Systems for Coverage Problems
Simons Institute via YouTube Approximating Maximum Matching Requires Almost Quadratic Time
Simons Institute via YouTube On (1 + ε)-Approximate (Vertex) Cut Sparsifiers
Simons Institute via YouTube Improved Bounds for Fully Dynamic Matching via Ordered Ruzsa-Szemeredi Graphs
Simons Institute via YouTube Almost-Optimal Sublinear Additive Spanners in Graph Theory
Simons Institute via YouTube