An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams

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


Duration: 21:01
398 views
10

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

An Asymptotically Optimal Algorithm for Maximum Matching in Dynamic Streams

Sepehr Assadi (Rutgers University)
Vihan Shah (Rutgers University)

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



Other Videos By Simons Institute for the Theory of Computing


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
2022-01-28Bounded indistinguishability for simple sources
2022-01-28Small-Box Cryptography
2022-01-28Individual Fairness in Advertising Auctions through Inverse Proportionality
2022-01-28On Hardness Assumptions Needed for ``Extreme High-End'' PRGs and Fast Derandomization
2022-01-28Uniform Bounds for Scheduling with Job Size Estimates
2022-01-28Cursed yet Satisfied Agents
2022-01-28Lifting With Sunflowers
2022-01-28Improved Hardness of BDD and SVP Under Gap-(S)ETH