Algorithms
5Circular Trace Reconstruction
Shyam Narayanan (Massachusetts Institute of Technology), Michael Ren (Massachusetts Institute of Technology)
Sampling Arborescences in Parallel
Nima Anari (Stanford University), Nathan Hu (Stanford University), Amin Saberi (Stanford University), Aaron Schild (University of Washington)
Polynomial-time trace reconstruction in the low deletion rate regime
Xi Chen (Columbia University), Anindya De (University of Pennsylvania), Chin Ho Lee (Columbia University), Rocco A. Servedio (Columbia University), Sandip Sinha (Columbia University)
A New Connection Between Node and Edge Depth Robust Graphs
Jeremiah Blocki (Purdue University), Mike Cinkoske (UIUC)
Algorithms and Hardness for Multidimensional Range Updates and Queries
Joshua Lau, Angus Ritossa (UNSW Sydney)
ITCS 2021
Other Videos By Simons Institute for the Theory of Computing
| 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 |
| 2021-01-10 | Quantum |
| 2021-01-09 | Analytic methods |
| 2021-01-09 | Computational complexity |
| 2021-01-08 | Distributed models |
| 2021-01-08 | Pseudorandomness |
| 2021-01-08 | Crypto and Privacy |
| 2021-01-08 | Matchings |