YoVDO

IEEE FOCS: Foundations of Computer Science Courses

Independent Set on P_k-Free Graphs in Quasi-Polynomial Time
IEEE via YouTube
Smoothed Complexity of 2-player Nash Equilibria
IEEE via YouTube
On Light Spanners, Low-Treewidth Embeddings and Efficient Traversing in Minor-Free Graphs
IEEE via YouTube
Pseudospectral Shattering the Sign Function and Diagonalization in Nearly Matrix Multiplication Time
IEEE via YouTube
Communication Complexity of Nash Equilibrium in Potential Games
IEEE via YouTube
LDPC Codes Achieve List Decoding Capacity
IEEE via YouTube
Near Optimal Linear Algebra in the Online and Sliding Window Models
IEEE via YouTube
Stochastic Weighted Matching - 1-Epsilon Approximation
IEEE via YouTube
Circulation Control for Faster Minimum Cost Flow in Unit-Capacity Graphs
IEEE via YouTube
Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time
IEEE via YouTube
< Prev Page 3 Next >