| 2023 | COLT | Algorithmically Effective Differentially Private Synthetic Data. | Yiyun He, Roman Vershynin, Yizhe Zhu |
| 2018 | COLT | Polynomial Time and Sample Complexity for Non-Gaussian Component Analysis: Spectral Methods. | Yan Shuo Tan, Roman Vershynin |
| 2017 | ISIT | Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization. | Jess Banks, Cristopher Moore, Roman Vershynin, Nicolas Verzelen, Jiaming Xu |
| 2008 | ACSSC | Greedy signal recovery review. | Deanna Needell, Joel A. Tropp, Roman Vershynin |
| 2007 | STOC | One sketch for all: fast algorithms for compressed sensing. | Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, Roman Vershynin |
| 2006 | CISS | Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements. | Mark Rudelson, Roman Vershynin |
| 2006 | FOCS | Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method. | Roman Vershynin |
| 2005 | FOCS | Error Correction via Linear Programming. | Emmanuel J. Cands, Mark Rudelson, Terence Tao, Roman Vershynin |
| 2002 | COLT | Entropy, Combinatorial Dimensions and Random Averages. | Shahar Mendelson, Roman Vershynin |