Simons Institute for the Theory of Computing
460 old videos with fewer than 5,000 views from this channel.
-
36:36
An Overview of Quantified Derandomization
-
34:52
Hardness Magnification
-
27:22
New Lower Bounds Through an Improved Easy Witness Lemma
-
34:47
Does Looking Inside a Circuit Help?
-
29:09
Recent Advances in Positive Semidefinite Matrix Approximation
-
34:32
Convergence Theory for Iterative Eigensolvers
-
33:27
Hessian Matrix Inversion in 10^10 Dimensions with Parametric Bootstraps
-
34:47
Smoothed Analysis of Low Rank Solutions to Semidefinite Programs via Burer Monteiro Factorization
-
34:04
Fast Algorithms for Multivariate ODEs arising in Sampling and Learning
-
33:49
Subspace Clustering using Ensembles of K-Subspaces
-
1:05:27
The Hardest Halfspace
-
35:36
On a Composition Theorem for Randomized Query Complexity
-
31:00
Time-Space Tradeoffs for the Memory Game
-
37:57
Simulation beats Richness: New Data-Structure Lower Bounds
-
34:35
Why Extension-Based Proofs Fail
-
26:50
Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication
-
34:02
The Sketching Complexity of Graph and Hypergraph Counting
-
29:48
Distributed Statistical Estimation of Matrix Products with Applications
-
51:50
Mathematical Theories of Communication: Old and New
-
49:01
Robust List Decoding of Spherical Gaussians
-
43:33
Mixture Models, Robustness, and Sum of Squares Proofs
-
43:46
Invariance, Causality and Novel Robustness
-
41:12
Generalization Bounds for Uniformly Stable Algorithms
-
43:37
Orthogonal Machine Learning: Power and Limitations