Expander $\ell_0$-Decoding
Mendoza-Smith, R
Tanner, J
(05 Aug 2015)
doi:10.48550/arxiv.1508.01256
On the construction of sparse matrices from expander graphs
Bah, B
Tanner, J
(24 Apr 2018)
doi:10.48550/arxiv.1804.09212
Matrix rigidity and the ill-posedness of Robust PCA and matrix completion
Tanner, J
Thompson, A
Vary, S
(14 Nov 2018)
doi:10.48550/arxiv.1811.05919
Multispectral snapshot demosaicing via non-convex matrix completion
Antonucci, G
Vary, S
Humphreys, D
Lamb, R
Piper, J
Tanner, J
(28 Feb 2019)
doi:10.48550/arxiv.1902.11032
Vanishingly Sparse Matrices and Expander Graphs, With Application to Compressed Sensing
Bah, B
Tanner, J
(12 Jul 2012)
doi:10.48550/arxiv.1207.3094
Bounds of restricted isometry constants in extreme asymptotics: formulae for Gaussian matrices
Bah, B
Tanner, J
(20 Jul 2012)
doi:10.48550/arxiv.1207.4883
Identification of Matrices having a Sparse Representation
Pfander, G
Rauhut, H
Tanner, J
(22 Apr 2015)
doi:10.48550/arxiv.1504.05807
On construction and analysis of sparse random matrices and expander graphs with applications to compressed sensing
Bah, B
Tanner, J
(24 Jul 2013)
doi:10.48550/arxiv.1307.6477
Parallel multi-scale reduction of persistent homology filtrations
Mendoza-Smith, R
Tanner, J
(15 Aug 2017)
doi:10.48550/arxiv.1708.04710
An Approximate Message Passing Algorithm for Rapid Parameter-Free Compressed Sensing MRI
Millard, C
Hess, A
Mailhé, B
Tanner, J
(04 Nov 2019)
doi:10.48550/arxiv.1911.01234