- SIGNAL RECOVERY FROM RANDOM MEASUREMENTS VIA ORTHOGONAL MATCHING PURSUIT
- Random processes via the combinatorial dimension: introductory notes
- On constructions of strong and uniformly minimal M-bases in Banach spaces
- BEYOND HIRSCH CONJECTURE: WALKS ON RANDOM POLYTOPES AND SMOOTHED COMPLEXITY OF THE SIMPLEX METHOD
- DOI: 10.1007/s00222-002-0266-3 Invent. math. 152, 3755 (2003)
- Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements
- Acta Math. Univ. Comenianae Vol. LXIX, 2(2000), pp. 137144
- The selection problem for bases with brackets and for strong M-bases
- Signal Recovery From Incomplete and Inaccurate Measurements via Regularized Orthogonal
- JOHN'S DECOMPOSITIONS: SELECTING A LARGE PART R. VERSHYNIN
- GAFA, Geom. funct. anal. Vol. 12 (2002) 183 198
- arXiv:0805.3523v1[math.PR]22May2008 THE LEAST SINGULAR VALUE OF A RANDOM SQUARE
- On the Role of Sparsity in Compressed Sensing and Random Matrix Theory
- Frame expansions with erasures: an approach through the non-commutative operator theory
- IMS Lecture NotesMonograph Series Random sets of isomorphism of linear
- Isoperimetry of waists and local versus global asymptotic convex geometries
- Introduction to the non-asymptotic analysis of random Roman Vershynin
- Lectures in Geometric Functional Roman Vershynin
- Proceedings of the International Congress of Mathematicians Hyderabad, India, 2010
- Invertibility of symmetric random matrices Roman Vershynin
- HOW CLOSE IS THE SAMPLE COVARIANCE MATRIX TO THE ACTUAL COVARIANCE MATRIX?
- SPECTRAL NORM OF PRODUCTS OF RANDOM AND DETERMINISTIC MATRICES
- THE SMALLEST SINGULAR VALUE OF A RANDOM RECTANGULAR MATRIX
- Signal recovery from incomplete and inaccurate measurements via ROMP
- Greedy Signal Recovery and Uncertainty Principles Deanna Needell and Roman Vershynin
- UNIFORM UNCERTAINTY PRINCIPLE AND SIGNAL RECOVERY VIA REGULARIZED ORTHOGONAL MATCHING
- THE LITTLEWOOD-OFFORD PROBLEM AND INVERTIBILITY OF RANDOM MATRICES
- SAMPLING FROM LARGE MATRICES: AN APPROACH THROUGH GEOMETRIC FUNCTIONAL ANALYSIS
- Small ball probability and Dvoretzky Theorem , R. Vershynin
- A randomized solver for linear systems with exponential convergence
- BEYOND HIRSCH CONJECTURE: WALKS ON RANDOM POLYTOPES AND SMOOTHED COMPLEXITY OF THE SIMPLEX METHOD
- ON SPARSE RECONSTRUCTION FROM FOURIER AND GAUSSIAN MEASUREMENTS
- Combinatorics of random processes and sections of convex bodies
- INTEGER CELLS IN CONVEX SETS R. VERSHYNIN
- FRAMES AND THE FEICHTINGER CONJECTURE PETER G. CASAZZA, OLE CHRISTENSEN,
- Remarks on the Geometry of Coordinate Projections in Rn
- SIZES OF PROJECTIONS OF SYMMETRIC CONVEX N. TOMCZAK-JAEGERMANN AND R. VERSHYNIN
- Subsequences of frames R. Vershynin
- p -STRUCTURES IN SPACES WITH EXTREMAL PARAMETERS
- PARTIAL ESTIMATION OF COVARIANCE MATRICES ELIZAVETA LEVINA AND ROMAN VERSHYNIN
- Entropy, Combinatorial Dimensions and Random Averages
- A randomized Kaczmarz algorithm with exponential convergence
- GEOMETRIC APPROACH TO ERROR CORRECTING CODES AND RECONSTRUCTION OF SIGNALS
- SOME PROBLEMS IN ASYMPTOTIC CONVEX GEOMETRY AND RANDOM MATRICES MOTIVATED BY
- APPROXIMATING THE MOMENTS OF MARGINALS OF HIGH DIMENSIONAL DISTRIBUTIONS
- Uncertainty principles and vector quantization
- KALTON AND QUASI-BANACH SPACES Nigel Kalton's general solution to the three-space problem [3, 4] was
- A SIMPLE DECOUPLING INEQUALITY IN PROBABILITY THEORY
- arXiv:1106.2775v1[math.PR]14Jun2011 COVARIANCE ESTIMATION FOR DISTRIBUTIONS WITH 2 +
- DIMENSION REDUCTION BY RANDOM HYPERPLANE TESSELLATIONS YANIV PLAN AND ROMAN VERSHYNIN
- ONE-BIT COMPRESSED SENSING BY LINEAR PROGRAMMING YANIV PLAN AND ROMAN VERSHYNIN
- ROBUST 1-BIT COMPRESSED SENSING AND SPARSE LOGISTIC REGRESSION: A CONVEX PROGRAMMING APPROACH
