| Solving ptychography with a convex relaxation R Horstmeyer, RY Chen, X Ou, B Ames, JA Tropp, C Yang New journal of physics 17 (5), 053044, 2015 | 163 | 2015 |
| Nuclear norm minimization for the planted clique and biclique problems BPW Ames, SA Vavasis Mathematical programming 129 (1), 69-89, 2011 | 153 | 2011 |
| Guaranteed clustering and biclustering via semidefinite programming BPW Ames Mathematical Programming 147 (1), 429-465, 2014 | 76 | 2014 |
| Convex optimization for the planted k-disjoint-clique problem BPW Ames, SA Vavasis Mathematical Programming 143 (1), 299-337, 2014 | 67 | 2014 |
| Alternating direction method of multipliers for penalized zero-variance discriminant analysis BPW Ames, M Hong arXiv preprint arXiv:1401.5492 26, 2014 | 49 | 2014 |
| Guaranteed recovery of planted cliques and dense subgraphs by convex relaxation BPW Ames Journal of Optimization Theory and Applications 167 (2), 653-675, 2015 | 37* | 2015 |
| A leapfrog strategy for pursuit-evasion in a polygonal environment B Ames, A Beveridge, R Carlson, C Djang, V Isler, S Ragain, M Savage International Journal of Computational Geometry & Applications 25 (02), 77-100, 2015 | 18 | 2015 |
| Convex optimization for the densest subgraph and densest submatrix problems P Bombina, B Ames SN Operations Research Forum 1 (3), 23, 2020 | 16 | 2020 |
| Proximal methods for sparse optimal scoring and discriminant analysis S Atkins, G Einarsson, B Ames, L Clemmensen arXiv preprint arXiv:1705.07194, 2017 | 12* | 2017 |
| Classification of visual comprehension based on EEG data using sparse optimal scoring LK Ford, JD Borneman, J Krebs, EA Malaia, BP Ames Journal of Neural Engineering 18 (2), 026025, 2021 | 10 | 2021 |
| Exact clustering of weighted graphs via semidefinite programming A Pirinen, B Ames Journal of Machine Learning Research 20 (30), 1-34, 2019 | 8* | 2019 |
| Derivatives of compound matrix valued functions BPW Ames, HS Sendov Journal of Mathematical Analysis and Applications 433 (2), 1459-1485, 2016 | 8 | 2016 |
| Convex relaxation for the planted clique, biclique, and clustering problems B Ames University of Waterloo, 2011 | 7 | 2011 |
| Salience of low-frequency entrainment to visual signal for classification points to predictive processing in sign language. In proceedings of 30th annual computational … E Malaia, LK Ford Journal of Computational Neuroscience 49 (S1), 2021 | 4 | 2021 |
| Asymptotic expansions of the ordered spectrum of symmetric matrices BPW Ames, HS Sendov Nonlinear Analysis: Theory, Methods & Applications 72 (11), 4288-4297, 2010 | 3 | 2010 |
| A new derivation of a formula by Kato BPW Ames, HS Sendov Linear algebra and its applications 436 (3), 722-730, 2012 | 2 | 2012 |
| A sparse regression approach for evaluating and predicting NHL results N Laffey, B Ames December, 2016 | 1 | 2016 |
| Provably Finding a Hidden Dense Submatrix among Many Planted Dense Submatrices via Convex Programming V Olanubi, P Agar, B Ames arXiv preprint arXiv:2601.03946, 2026 | | 2026 |
| Dyadic Neural Dynamics: Extending Representation Learning to Social Neuroscience M Glushanina, J Huang, M McCleod, B Ames, E Malaia arXiv preprint arXiv:2509.23479, 2025 | | 2025 |
| How to Reliably Find a Hidden Clique B Ames | | 2017 |
Xiaoze OuBytedance IncVerified email at bytedance.com
