The Power of Convex Relaxation: Near-Optimal Matrix Completion
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
An Incidence Theorem in Higher Dimensions
Structure and Randomness in Combinatorics
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS’07)
IEEE Transactions on Information Theory
Discrete & Computational Geometry
Emmanuel J. Candès
József Solymosi
Revealed Preference at Scale
Computing the Distance between Piecewise-Linear Bivariate Functions
Toward a Unified Theory of Sparse Dimensionality Reduction in Euclidean Space
Beyond worst-case analysis in private singular vector computation
Subspace Clustering Using Log-determinant Rank Approximation
Inverse conjecture for the gowers norm is false