Tensor-based hardness of the shortest vector problem to within almost polynomial factors
Low-degree tests at large distances
Uncertainty principles, extractors, and explicit embeddings of l2 into l1
Lower bounds in communication complexity based on factorization norms
A combinatorial, primal-dual approach to semidefinite programs
Sampling-based dimension reduction for subspace approximation