ITCS 2022 Session 3

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=a2rMOCswT-E


Duration: 1:00:45
364 views
0

Chair: Mahsa Derakhshan

Dynamic Matching Algorithms Under Vertex Updates
Hung Le (University of Massachusetts); Lazar Milenkovic and Shay Solomon (Tel Aviv University); Virginia Vassilevska Williams (Massachusetts Institute of Technology)
Beating the Folklore Algorithm for Dynamic Matching
Mohammad Roghani, Amin Saberi, and David Wajc (Stanford University)
Deterministic Dynamic Matching In Worst-Case Update Time
Peter Kiss (PhD Student at University of Warwick)
Local Access to Random Walks
Amartya Shankha Biswas (MIT); Edward Pyne (Harvard University); Ronitt Rubinfeld (MIT)
Uniform brackets, containers, and combinatorial Macbeath regions
Kunal Dutta (University of Warsaw); Arijit Ghosh (Indian Statistical Institute); Shay Moran (Technion and Google Research)

13th Innovations in Theoretical Computer Science (ITCS) Conference



Other Videos By Simons Institute for the Theory of Computing


2022-02-02ITCS 2022 Session 9
2022-02-02ITCS 2022 Session 8
2022-02-01ITCS 2022 Graduating Bits
2022-02-01ITCS 2022 Session 7
2022-02-01Uniform brackets, containers, and combinatorial Macbeath regions
2022-02-01FPT Algorithms for Finding Near-Cliques in $c$-Closed Graphs
2022-02-01Counting and Sampling Perfect Matchings in Regular Expanding Non-Bipartite Graphs
2022-02-01ITCS 2022 Session 6
2022-02-01ITCS 2022 Session 5
2022-02-01ITCS 2022 Session 4
2022-02-01ITCS 2022 Session 3
2022-01-31ITCS 2022 Session 2
2022-01-31ITCS 2022 Session 1
2022-01-31Randomness Extraction from Somewhat Dependent Sources
2022-01-31Noisy Boolean Hidden Matching with Applications
2022-01-31Small Circuits Imply Efficient Arthur-Merlin Protocols
2022-01-29Multi-Agent Reinforcement Learning (Part II)
2022-01-29Multi-Agent Reinforcement Learning (Part I)
2022-01-29Reinforcement Learning (Part II)
2022-01-28Reinforcement Learning (Part I)
2022-01-28Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descr