ITCS 2022 Session 12
0Chair: Omri Ben-Eliezer
Noisy Boolean Hidden Matching with Applications
Michael Kapralov (EPFL); Amulya Musipatla (CMU); Jakab Tardos (EPFL); David Woodruff and Samson Zhou (CMU)
Adversarially Robust Coloring for Graph Streams
Amit Chakrabarti, Prantar Ghosh, and Manuel Stoeckl (Dartmouth College)
Optimal Bounds for Dominating Set in Graph Streams
Sanjeev Khanna (University of Pennsylvania); Christian Konrad (University of Bristol)
An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes
Anubhav Baweja, Justin Jia, and David P. Woodruff (Carnegie Mellon University)
An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams
Sepehr Assadi and Vihan Shah (Rutgers University)
13th Innovations in Theoretical Computer Science (ITCS) Conference
Other Videos By Simons Institute for the Theory of Computing
| 2022-02-04 | ITCS 2022 Session 21 |
| 2022-02-03 | ITCS 2022 Session 19 |
| 2022-02-03 | ITCS 2022 Session 20 |
| 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 |