ITCS 2022 Session 9
Chair: Rotem Oshman
Distributed Vertex Cover Reconfiguration
Yannic Maus (TU Graz); Keren Censor-Hillel, Shahar Romem-Peled, and Tigran Tonoyan (Technion)
Near-Optimal Distributed Implementations of Dynamic Algorithms for Symmetry Breaking Problems
Shiri Antaki (Tel Aviv University); Quanquan C. Liu (MIT); Shay Solomon (Tel Aviv University)
Continuous Tasks and the Asynchronous Computability Theorem
Hugo Rincon Galeana (TU Wien); Sergio Rajsbaum (UNAM); Ulrich Schmid (TU Wien)
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
Sebastian Brandt (CISPA Helmholtz Center for Information Security); Yi-Jun Chang (National University of Singapore); Jan Grebík (Warwick); Christoph Grunau and Václav Rozhoň (ETH Zurich); Zoltán Vidnyánszky (Caltech)
Adaptive Massively Parallel Constant-round Tree Contraction
MohammadTaghi Hajiaghayi, Marina Knittel, and Hamed Saleh (University of Maryland); Hsin-Hao Su (Boston College)
13th Innovations in Theoretical Computer Science (ITCS) Conference
Other Videos By Simons Institute for the Theory of Computing
2022-02-03 | ITCS 2022 Session 18 |
2022-02-03 | ITCS 2022 Session 17 |
2022-02-03 | ITCS 2022 Session 16 |
2022-02-02 | ITCS 2022 Session 15 |
2022-02-02 | ITCS 2022 Session 14 |
2022-02-02 | ITCS 2022 Session 13 |
2022-02-02 | ITCS 2022 Graduating Bits |
2022-02-02 | ITCS 2022 Session 12 |
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 |