Online and streaming algorithms
5Metrical Service Systems with Transformations
Sebastien Bubeck (Microsoft Research), Niv Buchbinder (Tel Aviv Univrsity), Christian Coester (CWI), Mark Sellke (Stanford University)
Unknown I.I.D. Prophets: Better Bounds, Streaming Algorithms, and a New Impossibility
José Correa (Universidad de Chile), Paul Dütting (London School of Economics), Felix Fischer (Queen
Mary University of London), Kevin Schewior (Universität zu Köln), Bruno Ziliotto (Université Paris-Dauphine)
Online Search With a Hint
Spyros Angelopoulos (CNRS and Sorbonne University)
Online Paging with a Vanishing Regret
Yuval Emek (Technion), Shay Kutten (Technion, Israel), Yangguang Shi (Technion)
Sensitivity Analysis of the Maximum Matching Problem
Yuichi Yoshida (National Institute of Informatics), Samson Zhou (Carnegie Mellon University)
ITCS 2021
Other Videos By Simons Institute for the Theory of Computing
| 2021-01-15 | Pipeline Interventions |
| 2021-01-15 | Pseudorandom Generators for Unbounded-Width Permutation Branching Programs |
| 2021-01-15 | Sharp Threshold Rates for Random Codes |
| 2021-01-15 | The Complexity of Finding Fair Independent Sets in Cycles |
| 2021-01-15 | Algorithmic Persuasion with Evidence |
| 2021-01-15 | Comparing computational entropies below majority (or: When is the dense model theorem false?) |
| 2021-01-15 | The entropy of lies: playing twenty questions with a liar |
| 2021-01-12 | Error Correcting Codes for Uncompressed Messages |
| 2021-01-12 | Algorithms and Hardness for Multidimensional Range Updates and Queries |
| 2021-01-12 | Algebraic and circuit complexity |
| 2021-01-12 | Online and streaming algorithms |
| 2021-01-12 | Algorithmic Game Theory |
| 2021-01-12 | Optimization |
| 2021-01-12 | Codes and information |
| 2021-01-12 | Machine Learning |
| 2021-01-11 | Circuits and communication |
| 2021-01-10 | Graph algorithms |
| 2021-01-10 | Algorithms |
| 2021-01-10 | GRADUATING BITS |
| 2021-01-10 | Algorithmic game theory |
| 2021-01-10 | Quantum information |