Analytic methods
9Theorems of KKL, Friedgut, and Talagrand via Random Restrictions and Log-Sobolev Inequality
Esty Kelman (Tel Aviv University), Subhash Khot (NYU), Guy Kindler (Hebrew University), Dor Minzer (MIT), Muli Safra (Tel-Aviv University)
The Strongish Planted Clique Hypothesis and Its Consequences
Pasin Manurangsi (Google Research), Aviad Rubinstein (Stanford), Tselil Schramm (Stanford)
Ordered Graph Limits and Their Applications
Omri Ben-Eliezer (Harvard University), Eldar Fischer (Technion - Israel Institute of Technology), Amit Levi (University of Waterloo), Yuichi Yoshida (National Institute of Informatics)
Pseudobinomiality of the Sticky Random Walk
Venkatesan Guruswami (CMU), Vinayak Kumar (California Institute of Technology)
On Rich 2-to-1 Games
Mark Braverman (Princeton University), Subhash Khot (NYU), Dor Minzer (MIT)
ITCS 2021
Other Videos By Simons Institute for the Theory of Computing
| 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 |
| 2021-01-08 | Introductory Remarks |
| 2020-12-28 | David Harold Blackwell Summer Research Institute | Interview with Jelani Nelson |
| 2020-12-19 | Recent Developments in Supervised Learning With Noise |
| 2020-12-19 | Testing and Reconstruction via Decision Trees |
| 2020-12-18 | An Equivalence Between Private Classification and Online Prediction |