IEEE FOCS: Foundations of Computer Science Courses
IEEE via YouTube Fully Online Matching II - Beating Ranking and Water-filling
IEEE via YouTube Tree-Depth and the Formula Complexity of Subgraph Isomorphism
IEEE via YouTube Optimal Anytime Regret with Two Experts
IEEE via YouTube Beyond Tree Embeddings - A Deterministic Framework for Network Design with Deadlines or Delay
IEEE via YouTube Composition Theorems via Lifting
IEEE via YouTube Towards Better Approximation of Graph Crossing Number
IEEE via YouTube Polynomial Data Structure Lower Bounds in the Group Model
IEEE via YouTube Quantum Isomorphism Is Equivalent to Equality of Homomorphism Counts from Planar Graphs
IEEE via YouTube Optimal Streaming Approximations for All Boolean Max 2-CSPs and Max k-SAT
IEEE via YouTube