Adversarially Robust Coloring for Graph Streams

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


Duration: 37:04
172 views
4

13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
http://itcs-conf.org/

Adversarially Robust Coloring for Graph Streams

Amit Chakrabarti (Dartmouth College)
Prantar Ghosh (Dartmouth College)
Manuel Stoeckl (Dartmouth College)

https://doi.org/10.4230/LIPIcs.ITCS.2022.37



Other Videos By Simons Institute for the Theory of Computing


2022-01-28Time-Traveling Simulators Using Blockchains and Their Applications
2022-01-28An Efficient Semi-Streaming PTAS for Tournament Feedback Arc Set with Few Passes
2022-01-28Pre-Constrained Encryption
2022-01-28Algorithms and Lower Bounds for Comparator Circuits from Shrinkage
2022-01-28Correlation detection in trees for planted graph alignment
2022-01-28Improved Decoding of Expander Codes
2022-01-28Interactive Proofs for Synthesizing Quantum States and Unitaries
2022-01-28PCPs and Instance Compression from a Cryptographic Lens
2022-01-28Nash-Bargaining-Based Models for Matching Markets: One-Sided and Two-Sided; Fisher and Arrow-Debreu
2022-01-28Quantum Meets the Minimum Circuit Size Problem
2022-01-28Adversarially Robust Coloring for Graph Streams
2022-01-28A Spectral Approach to Polytope Diameter
2022-01-28Matroid Secretary is Equivalent to Contention Resolution
2022-01-28Omnipredictors
2022-01-28Locality-Preserving Hashing for Shifts with Connections to Cryptography
2022-01-28Limits of quantum speed-ups for computational geometry and other problems: Fine-grained complexity v
2022-01-28Pseudorandom Self-Reductions for NP-Complete Problems
2022-01-28Optimal Bounds for Dominating Set in Graph Streams
2022-01-28Smaller ACC0 Circuits for Symmetric Functions
2022-01-28Keep That Card in Mind: Card Guessing with Limited Memory
2022-01-28Multi-Channel Bayesian Persuasion