Circuits and communication
6A new approach to quantitative correlation inequalities
Shivam Nadimpalli (Columbia University), Rocco A. Servedio (Columbia University), Anindya De (University of Pennsylvania)
Circuit Depth Reductions
Alexander Golovnev (Georgetown University), Alexander S. Kulikov (Steklov Institute of Mathematics at St. Petersburg), Ryan Williams (MIT)
Shrinkage of Decision Lists and DNF Formulas
Benjamin Rossman (Duke University)
Computation Over the Noisy Broadcast Channel with Malicious Parties
Klim Efremenko (Ben-Gurion University), Gillat Kol (Princeton University), Dmitry Paramonov (Princeton University), Raghuvansh R. Saxena (Princeton University)
Communication memento: Memoryless communication complexity
Srinivasan Arunachalam (IBM Research), Supartha Podder (University of Ottawa, Canada)
Differentially Oblivious Turing Machines
Ilan Komargodski (NTT Research and Hebrew University), Elaine Shi (Cornell University)
ITCS 2021
Other Videos By Simons Institute for the Theory of Computing
| 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 |
| 2021-01-10 | Quantum |
| 2021-01-09 | Analytic methods |
| 2021-01-09 | Computational complexity |
| 2021-01-08 | Distributed models |
| 2021-01-08 | Pseudorandomness |