| Introduction to the non-asymptotic analysis of random matrices R Vershynin arXiv preprint arXiv:1011.3027, 2010 | 2742 | 2010 |
| High-dimensional probability: An introduction with applications in data science R Vershynin Cambridge university press, 2018 | 1820 | 2018 |
| Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit D Needell, R Vershynin Foundations of computational mathematics 9 (3), 317-334, 2009 | 1254 | 2009 |
| Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit D Needell, R Vershynin IEEE Journal of selected topics in signal processing 4 (2), 310-316, 2010 | 1150 | 2010 |
| On sparse reconstruction from Fourier and Gaussian measurements M Rudelson, R Vershynin Communications on Pure and Applied Mathematics: A Journal Issued by the …, 2008 | 929 | 2008 |
| A randomized Kaczmarz algorithm with exponential convergence T Strohmer, R Vershynin Journal of Fourier Analysis and Applications 15 (2), 262-278, 2009 | 746 | 2009 |
| Hanson-wright inequality and sub-gaussian concentration M Rudelson, R Vershynin Electronic Communications in Probability 18, 1-9, 2013 | 611 | 2013 |
| Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach Y Plan, R Vershynin IEEE Transactions on Information Theory 59 (1), 482-494, 2012 | 461 | 2012 |
| One‐bit compressed sensing by linear programming Y Plan, R Vershynin Communications on Pure and Applied Mathematics 66 (8), 1275-1297, 2013 | 417 | 2013 |
| The Littlewood–Offord problem and invertibility of random matrices M Rudelson, R Vershynin Advances in Mathematics 218 (2), 600-633, 2008 | 386 | 2008 |
| Non-asymptotic theory of random matrices: extreme singular values M Rudelson, R Vershynin Proceedings of the International Congress of Mathematicians 2010 (ICM 2010 …, 2010 | 372 | 2010 |
| Error correction via linear programming E Candes, M Rudelson, T Tao, R Vershynin 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), 668-681, 2005 | 362 | 2005 |
| One sketch for all: fast algorithms for compressed sensing AC Gilbert, MJ Strauss, JA Tropp, R Vershynin Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007 | 355 | 2007 |
| Sampling from large matrices: An approach through geometric functional analysis M Rudelson, R Vershynin Journal of the ACM (JACM) 54 (4), 21-es, 2007 | 344 | 2007 |
| Smallest singular value of a random rectangular matrix M Rudelson, R Vershynin Communications on Pure and Applied Mathematics: A Journal Issued by the …, 2009 | 341 | 2009 |
| Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements M Rudelson, R Vershynin 2006 40th Annual Conference on Information Sciences and Systems, 207-212, 2006 | 297 | 2006 |
| How close is the sample covariance matrix to the actual covariance matrix? R Vershynin Journal of Theoretical Probability 25 (3), 655-686, 2012 | 270 | 2012 |
| Geometric approach to error-correcting codes and reconstruction of signals M Rudelson, R Vershynin International mathematics research notices 2005 (64), 4019-4041, 2005 | 209 | 2005 |
| Algorithmic linear dimension reduction in the l_1 norm for sparse vectors AC Gilbert, MJ Strauss, JA Tropp, R Vershynin arXiv preprint cs/0608079, 2006 | 197 | 2006 |
| Community detection in sparse networks via Grothendieck’s inequality O Guédon, R Vershynin Probability Theory and Related Fields 165 (3), 1025-1049, 2016 | 193 | 2016 |
Yaniv PlanUniversity of British ColumbiaVerified email at math.ubc.ca
