ITCS 2022 Session 5
0Chair: Ken Clarkson
Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing
Nikhil Bansal (University of Michigan); Haotian Jiang (University of Washington); Raghu Meka (UCLA); Sahil Singla (Georgia Tech); Makrand Sinha (Simons Institute and UC Berkeley)
Budget-Smoothed Analysis for Submodular Maximization
Aviad Rubinstein and Junyao Zhao (Stanford University)
Multiscale entropic regularization for MTS on general metric spaces
Farzam Ebrahimnejad and James R. Lee (University of Washington)
A Spectral Approach to Polytope Diameter
Nikhil Srivastava (UC Berkeley); Hariharan Narayanan (TIFR, Mumbai); Rikhav Shah (UC Berkeley)
Matroid Secretary is Equivalent to Contention Resolution
Shaddin Dughmi (University of Southern California)
13th Innovations in Theoretical Computer Science (ITCS) Conference
Other Videos By Simons Institute for the Theory of Computing
| 2022-02-02 | ITCS 2022 Session 11 |
| 2022-02-02 | ITCS 2022 Session 10 |
| 2022-02-02 | ITCS 2022 Session 9 |
| 2022-02-02 | ITCS 2022 Session 8 |
| 2022-02-01 | ITCS 2022 Graduating Bits |
| 2022-02-01 | ITCS 2022 Session 7 |
| 2022-02-01 | Uniform brackets, containers, and combinatorial Macbeath regions |
| 2022-02-01 | FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs |
| 2022-02-01 | Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs |
| 2022-02-01 | ITCS 2022 Session 6 |
| 2022-02-01 | ITCS 2022 Session 5 |
| 2022-02-01 | ITCS 2022 Session 4 |
| 2022-02-01 | ITCS 2022 Session 3 |
| 2022-01-31 | ITCS 2022 Session 2 |
| 2022-01-31 | ITCS 2022 Session 1 |
| 2022-01-31 | Randomness Extraction from Somewhat Dependent Sources |
| 2022-01-31 | Noisy Boolean Hidden Matching with Applications |
| 2022-01-31 | Small Circuits Imply Efficient Arthur-Merlin Protocols |
| 2022-01-29 | Multi-Agent Reinforcement Learning (Part II) |
| 2022-01-29 | Multi-Agent Reinforcement Learning (Part I) |
| 2022-01-29 | Reinforcement Learning (Part II) |