Pravesh K. Kothari
where else to find them
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
- Adam Tauman Kalaionce
- Anupam Guptaonce
- Han Shaoonce
all 10 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Lightning Talks! | The Role of TCS in Modern Machine Learning | 2026-05-26 |
A rapid-fire set of concrete results: an online load‑balancing scheme learns from a 1% sample and achieves a 1+ε load guarantee (using fractional relaxations… | ||
| Smoothed CSP Refutation Is As Easy As Random, For Both Efficient Algorithms And Certificates | Rigorous Evidence for Information-Computation Trade-offs | 2021-09-13 |
Shows that starting from any worst-case clause hypergraph and flipping each literal with small constant probability (e.g. 0.01) yields the same density–time… | ||
| The Sum-of-Squares Approach to Clustering Non-Spherical Gaussian Mixtures | Computational Phase Transitions (Simons Institute, 2020) | 2020-09-21 |
Polynomial-time algorithm uses the Sum-of-Squares framework to robustly cluster non‑spherical k‑Gaussian mixtures with adversarially corrupted epsilon fraction… | ||
| Quantum Entanglement, Sum of Squares, and the Log Rank Conjecture | Hierarchies, Extended Formulations and Matrix-Analytic Techniques (2017) | 2017-11-06 |
Given a basis for an n×n matrix subspace with a promised rank‑one element (wanting ≈1% Frobenius error), the result gives a concrete algorithm: a… | ||
| nothing matches | ||