Year |
Citation |
Score |
2020 |
Guta M, Kahn J, Kueng R, Tropp JA. Fast state tomography with optimal error bounds Journal of Physics A. 53: 204001. DOI: 10.1088/1751-8121/Ab8111 |
0.348 |
|
2020 |
Martinsson P, Tropp JA. Randomized numerical linear algebra: Foundations and algorithms Acta Numerica. 29: 403-572. DOI: 10.1017/S0962492920000021 |
0.386 |
|
2019 |
Tropp JA, Yurtsever A, Udell M, Cevher V. Streaming Low-Rank Matrix Approximation With An Application To Scientific Simulation Siam Journal On Scientific Computing. 41. DOI: 10.1137/18M1201068 |
0.332 |
|
2018 |
Oymak S, Tropp JA. Universality laws for randomized dimension reduction, with applications Information and Inference: a Journal of the Ima. 7: 337-446. DOI: 10.1093/Imaiai/Iax011 |
0.371 |
|
2017 |
Tropp JA, Yurtsever A, Udell M, Cevher V. Practical Sketching Algorithms For Low-Rank Matrix Approximation Siam Journal On Matrix Analysis and Applications. 38: 1454-1485. DOI: 10.1137/17M1111590 |
0.481 |
|
2016 |
Paulin D, Mackey L, Tropp JA. Efron–Stein inequalities for random matrices Annals of Probability. 44: 3431-3473. DOI: 10.1214/15-Aop1054 |
0.325 |
|
2016 |
Tropp JA. Second-order matrix concentration inequalities Applied and Computational Harmonic Analysis. 44: 700-736. DOI: 10.1016/J.Acha.2016.07.005 |
0.381 |
|
2015 |
Horstmeyer R, Chen RY, Ou X, Ames B, Tropp JA, Yang C. Solving ptychography with a convex relaxation. New Journal of Physics. 17. PMID 26146480 DOI: 10.1088/1367-2630/17/5/053044 |
0.478 |
|
2015 |
Tropp JA. Integer factorization of a positive-definite matrix Siam Journal On Discrete Mathematics. 29: 1783-1791. DOI: 10.1137/15M1024718 |
0.383 |
|
2015 |
Bruer JJ, Tropp JA, Cevher V, Becker SR. Designing statistical estimators that balance sample size, risk, and computational cost Ieee Journal On Selected Topics in Signal Processing. 9: 612-624. DOI: 10.1109/Jstsp.2015.2400412 |
0.368 |
|
2015 |
Lerman G, McCoy MB, Tropp JA, Zhang T. Robust Computation of Linear Models by Convex Relaxation Foundations of Computational Mathematics. 15: 363-410. DOI: 10.1007/S10208-014-9221-0 |
0.47 |
|
2014 |
Chen RY, Tropp JA. Subadditivity of matrix φ-entropy and concentration of random matrices Electronic Journal of Probability. 19. DOI: 10.1214/Ejp.V19-2964 |
0.372 |
|
2014 |
Mackey L, Jordan MI, Chen RY, Farrell B, Tropp JA. Matrix concentration inequalities via the method of exchangeable pairs Annals of Probability. 42: 906-945. DOI: 10.1214/13-Aop892 |
0.406 |
|
2014 |
Amelunxen D, Lotz M, McCoy MB, Tropp JA. Living on the edge: phase transitions in convex programs with random data Information and Inference: a Journal of the Ima. 3: 224-294. DOI: 10.1093/Imaiai/Iau005 |
0.411 |
|
2014 |
Needell D, Tropp JA. Paved with good intentions: Analysis of a randomized block Kaczmarz method Linear Algebra and Its Applications. 441: 199-221. DOI: 10.1016/J.Laa.2012.12.022 |
0.524 |
|
2014 |
McCoy MB, Tropp JA. Sharp Recovery Bounds for Convex Demixing, with Applications Foundations of Computational Mathematics. 14: 503-567. DOI: 10.1007/S10208-014-9191-2 |
0.427 |
|
2014 |
McCoy MB, Tropp JA. From Steiner Formulas for Cones to Concentration of Intrinsic Volumes Discrete and Computational Geometry. 51: 926-963. DOI: 10.1007/S00454-014-9595-4 |
0.355 |
|
2013 |
Pfander GE, Rauhut H, Tropp JA. The restricted isometry property for time-frequency structured random matrices Probability Theory and Related Fields. 156: 707-737. DOI: 10.1007/S00440-012-0441-4 |
0.315 |
|
2012 |
Chen RY, Gittens A, Tropp JA. The Masked Sample Covariance Estimator: An Analysis via Matrix Concentration Inequalities Information and Inference: a Journal of the Ima. 1: 2-20. DOI: 10.1093/Imaiai/Ias001 |
0.335 |
|
2012 |
Rauhut H, Romberg J, Tropp JA. Restricted isometries for partial random circulant matrices Applied and Computational Harmonic Analysis. 32: 242-254. DOI: 10.1016/J.Acha.2011.05.001 |
0.413 |
|
2012 |
Tropp JA. User-Friendly Tail Bounds for Sums of Random Matrices Foundations of Computational Mathematics. 12: 389-434. DOI: 10.1007/S10208-011-9099-Z |
0.412 |
|
2012 |
Tropp JA. A comparison principle for functions of a uniformly random subspace Probability Theory and Related Fields. 153: 759-769. DOI: 10.1007/S00440-011-0360-9 |
0.403 |
|
2011 |
Tropp JA. Freedman'S Inequality For Matrix Martingales Electronic Communications in Probability. 16: 262-270. DOI: 10.1214/Ecp.V16-1624 |
0.386 |
|
2011 |
McCoy M, Tropp JA. Two proposals for robust PCA using semidefinite programming Electronic Journal of Statistics. 5: 1123-1160. DOI: 10.1214/11-Ejs636 |
0.33 |
|
2011 |
Tropp JA. Improved analysis of the subsampled randomized hadamard transform Advances in Adaptive Data Analysis. 3: 115-126. DOI: 10.1142/S1793536911000787 |
0.322 |
|
2011 |
Halko N, Martinsson PG, Tropp JA. Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions Siam Review. 53: 217-288. DOI: 10.1137/090771806 |
0.495 |
|
2010 |
Needell D, Tropp JA. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples Communications of the Acm. 53: 93-100. DOI: 10.1016/J.Acha.2008.07.002 |
0.423 |
|
2008 |
Tropp JA. The random paving property for uniformly bounded matrices Studia Mathematica. 185: 67-82. DOI: 10.4064/Sm185-1-4 |
0.44 |
|
2008 |
Brickell J, Dhillon IS, Suvrit SRA, Tropp JA. The metric nearness problem Siam Journal On Matrix Analysis and Applications. 30: 375-396. DOI: 10.1137/060653391 |
0.68 |
|
2008 |
Gilbert AC, Strauss MJ, Tropp JA. A tutorial on fast fourier sampling: How to apply it to problems Ieee Signal Processing Magazine. 25: 57-66. DOI: 10.1109/Msp.2007.915000 |
0.432 |
|
2008 |
Dhillon IS, Heath RW, Strohmer T, Tropp JA. Constructing packings in Grassmannian manifolds via alternating projection Experimental Mathematics. 17: 9-35. DOI: 10.1080/10586458.2008.10129018 |
0.632 |
|
2008 |
Tropp JA. Norms of random submatrices and sparse approximation Comptes Rendus Mathematique. 346: 1271-1274. DOI: 10.1016/J.Crma.2008.10.008 |
0.479 |
|
2008 |
Tropp JA. On the conditioning of random subdictionaries Applied and Computational Harmonic Analysis. 25: 1-24. DOI: 10.1016/J.Acha.2007.09.001 |
0.419 |
|
2008 |
Tropp JA. On the linear independence of spikes and sines Journal of Fourier Analysis and Applications. 14: 838-858. DOI: 10.1007/S00041-008-9042-0 |
0.404 |
|
2007 |
Dhillon IS, Tropp JA. Matrix nearness problems with bregman divergences Siam Journal On Matrix Analysis and Applications. 29: 1120-1146. DOI: 10.1137/060649021 |
0.687 |
|
2007 |
Tropp JA, Gilbert AC. Signal recovery from random measurements via orthogonal matching pursuit Ieee Transactions On Information Theory. 53: 4655-4666. DOI: 10.1109/Tit.2007.909108 |
0.393 |
|
2007 |
Sustik MA, Tropp JA, Dhillon IS, Heath RW. On the existence of equiangular tight frames Linear Algebra and Its Applications. 426: 619-635. DOI: 10.1016/J.Laa.2007.05.043 |
0.587 |
|
2006 |
Dhillon IS, Heath RW, Sustik MA, Tropp JA. Generalized finite algorithms for constructing Hermitian matrices with prescribed diagonal and spectrum Siam Journal On Matrix Analysis and Applications. 27: 61-71. DOI: 10.1137/S0895479803438183 |
0.685 |
|
2006 |
Tropp JA. Just relax: Convex programming methods for identifying sparse signals in noise Ieee Transactions On Information Theory. 52: 1030-1051. DOI: 10.1109/Tit.2005.864420 |
0.48 |
|
2006 |
Tropp JA. Algorithms for simultaneous sparse approximation. Part II: Convex relaxation Signal Processing. 86: 589-602. DOI: 10.1016/J.Sigpro.2005.05.031 |
0.494 |
|
2006 |
Tropp JA, Gilbert AC, Strauss MJ. Algorithms for simultaneous sparse approximation. Part I: Greedy pursuit Signal Processing. 86: 572-588. DOI: 10.1016/J.Sigpro.2005.05.030 |
0.472 |
|
2006 |
Sra S, Tropp JA. Row-action methods for compressed sensing Icassp, Ieee International Conference On Acoustics, Speech and Signal Processing - Proceedings. 3: III868-III871. |
0.565 |
|
2005 |
Tropp JA. Complex equiangular tight frames Proceedings of Spie - the International Society For Optical Engineering. 5914: 1-11. DOI: 10.1117/12.618821 |
0.303 |
|
2005 |
Tropp JA. Average-case analysis of greedy pursuit Proceedings of Spie - the International Society For Optical Engineering. 5914: 1-11. DOI: 10.1117/12.618154 |
0.442 |
|
2005 |
Tropp JA. Recovery of short, complex linear combinations via l1 minimization Ieee Transactions On Information Theory. 51: 1568-1570. DOI: 10.1109/Tit.2005.844057 |
0.325 |
|
2005 |
Tropp JA, Dhillon IS, Heath RW, Strohmer T. Designing structured tight frames via an alternating projection method Ieee Transactions On Information Theory. 51: 188-209. DOI: 10.1109/Tit.2004.839492 |
0.688 |
|
2005 |
Dhillon IS, Sra S, Tropp JA. Triangle fixing algorithms for the metric nearness problem Advances in Neural Information Processing Systems. |
0.715 |
|
2004 |
Tropp JA, Dhillon IS, Heath RW. Finite-step algorithms for constructing optimal CDMA signature sequences Ieee Transactions On Information Theory. 50: 2916-2921. DOI: 10.1109/Tit.2004.836698 |
0.692 |
|
2004 |
Tropp JA. Greed is good: Algorithmic results for sparse approximation Ieee Transactions On Information Theory. 50: 2231-2242. DOI: 10.1109/Tit.2004.834793 |
0.496 |
|
2004 |
Tropp JA, Dhillon IS, Heath RW. Optimal CDMA signatures: A finite-step approach Ieee International Symposium On Spread Spectrum Techniques and Applications. 335-339. |
0.662 |
|
2004 |
Heath RW, Tropp JA, Dhillon IS, Strohmer T. Construction of equiangular signatures for synchronous CDMA systems Ieee International Symposium On Spread Spectrum Techniques and Applications. 708-712. |
0.642 |
|
2003 |
Tropp JA, Dhillon IS, Heath RW, Strohmer T. CDMA signature sequences with low peak-to-average-power ratio via alternating projection Conference Record of the Asilomar Conference On Signals, Systems and Computers. 1: 475-479. |
0.63 |
|
2003 |
Tropp JA, Heath RW, Strohmer T. Optimal CDMA signature sequences, inverse eigenvalue problems and alternating minimization Ieee International Symposium On Information Theory - Proceedings. 407. |
0.318 |
|
Show low-probability matches. |