Sublinear-Time Computation in the Presence of Online Erasures

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


Duration: 22:44
98 views
0

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

Sublinear-Time Computation in the Presence of Online Erasures

Iden Kalemaj (Boston University)
Sofya Raskhodnikova (Boston University)
Nithin Varma (Chennai Mathematical Institute)

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



Other Videos By Simons Institute for the Theory of Computing


2022-01-28A variant of the VC-dimension with applications to depth-3 circuits
2022-01-28Reduction From Non-Unique Games To Boolean Unique Games
2022-01-28Double Coverage with Machine-Learned Advice
2022-01-28Vertex Fault-Tolerant Emulators
2022-01-28Convex Influences
2022-01-28A Gaussian Fixed Point Random Walk
2022-01-28Maximizing revenue in the presence of intermediaries
2022-01-28Mixing in non-quasirandom groups
2022-01-28Sample-based Proofs of Proximity
2022-01-28Nonlinear Repair Schemes of Reed-Solomon Codes
2022-01-28Sublinear-Time Computation in the Presence of Online Erasures
2022-01-28Eliminating Intermediate Measurements using Pseudorandom Generators
2022-01-28Prefix Discrepancy, Smoothed Analysis, and Combinatorial Vector Balancing
2022-01-28Mixing of 3-term progressions in Quasirandom Groups
2022-01-28Distributed Vertex Cover Reconfiguration
2022-01-28On Fairness and Stability in Two-Sided Matchings
2022-01-28Learning and Incentives (Part IV)
2022-01-28Learning and Incentives (Part III)
2022-01-28Econometrics in Games and Auctions (Part II)
2022-01-27Econometrics in Games and Auctions (Part I)
2022-01-27Learning and Incentives (Part II)