# Roman Vershynin

According to our database

Collaborative distances:

^{1}, Roman Vershynin authored at least 20 papers between 2002 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

Information-Theoretic Bounds and Phase Transitions in Clustering, Sparse PCA, and Submatrix Localization.

IEEE Trans. Information Theory, 2018

Polynomial Time and Sample Complexity for Non-Gaussian Component Analysis: Spectral Methods.

Proceedings of the Conference On Learning Theory, 2018

2017

Concentration and regularization of random graphs.

Random Struct. Algorithms, 2017

Information-theoretic bounds and phase transitions in clustering, sparse PCA, and submatrix localization.

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

The Generalized Lasso With Non-Linear Observations.

IEEE Trans. Information Theory, 2016

2015

On the Effective Measure of Dimension in the Analysis Cosparse Model.

IEEE Trans. Information Theory, 2015

2014

Invertibility of symmetric random matrices.

Random Struct. Algorithms, 2014

Dimension Reduction by Random Hyperplane Tessellations.

Discrete & Computational Geometry, 2014

2013

Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach.

IEEE Trans. Information Theory, 2013

2010

Uncertainty principles and vector quantization.

IEEE Trans. Information Theory, 2010

Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit.

J. Sel. Topics Signal Processing, 2010

2009

Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method.

SIAM J. Comput., 2009

Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit.

Foundations of Computational Mathematics, 2009

2008

Greedy signal recovery and uncertainty principles.

Proceedings of the Computational Imaging VI, 2008

2007

Sampling from large matrices: An approach through geometric functional analysis.

J. ACM, 2007

One sketch for all: fast algorithms for compressed sensing.

Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2006

Beyond Hirsch Conjecture: Walks on Random Polytopes and Smoothed Complexity of the Simplex Method.

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

A Randomized Solver for Linear Systems with Exponential Convergence.

Proceedings of the Approximation, 2006

2005

Error Correction via Linear Programming.

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2002

Entropy, Combinatorial Dimensions and Random Averages.

Proceedings of the Computational Learning Theory, 2002