Optimal Bounds for Dominating Set in 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=7w36jpex3as


Duration: 42:11
80 views
1

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

Optimal Bounds for Dominating Set in Graph Streams

Sanjeev Khanna (University of Pennsylvania)
Christian Konrad (University of Bristol)

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



Other Videos By Simons Institute for the Theory of Computing


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
2022-01-28Interactive Communication in Bilateral Trade
2022-01-28Faster Sparse Matrix Inversion and Rank Computation in Finite Fields
2022-01-28Symmetric Sparse Boolean Matrix Factorization and Applications
2022-01-28Interaction Preserving Compilers for Secure Computation
2022-01-28An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams
2022-01-283 + ε Approximation of Tree Edit Distance in Truly Subquadratic Time
2022-01-28Support Recovery in Universal One-bit Compressed Sensing