Subhash Khot

Tensor decompositions for learning latent variable models

The backtracking survey propagation algorithm for solving random K-SAT problems

Mash: fast genome and metagenome distance estimation using MinHash

Discovering faster matrix multiplication algorithms with reinforcement learning

Angular synchronization by eigenvectors and semidefinite programming

A Unified Algorithmic Framework for Block-Structured Optimization Involving Big Data: With applications in machine learning and signal processing

The Computational Hardness of Estimating Edit Distance

Tensor Decomposition for Signal Processing and Machine Learning

Maximum Block Improvement and Polynomial Optimization

Past, present, and future of simultaneous localization and mapping: Toward the robust-perception age

Bell nonlocality

A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization

The Nature of Computation

Tensor Decompositions for Signal Processing Applications: From two-way to multiway component analysis

Mining of Massive Datasets

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

Unique Games with Entangled Provers Are Easy

Most Tensor Problems Are NP-Hard

Nonembeddability theorems via Fourier analysis

Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies

Vertex cover might be hard to approximate to within2−ε

Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?