| Approximate sparse recovery: optimizing time and measurements AC Gilbert, Y Li, E Porat, MJ Strauss SIAM Journal on Computing 41 (2), 436-453, 2012 | 131 | 2012 |
| Turnstile Streaming Algorithms Might as Well Be Linear Sketches Y Li, HL Nguyen, DP Woodruff SToC, 174-183, 2014 | 109 | 2014 |
| On sketching matrix norms and the top singular vector Y Li, HL Nguyễn, DP Woodruff Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 75 | 2014 |
| What’s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid P Boufounos, V Cevher, A Gilbert, Y Li, M Strauss Algorithmica 73 (2), 261-288, 2015 | 61 | 2015 |
| On approximating functions of the singular values in a stream Y Li, DP Woodruff Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 50 | 2016 |
| New characterizations in turnstile streams with applications Y Ai, W Hu, Y Li, DP Woodruff 31st Conference on Computational Complexity (CCC 2016), 2016 | 46 | 2016 |
| Learning-Augmented Data Stream Algorithms T Jiang, Y Li, H Lin, Y Ruan, DP Woodruff International Conference on Learning Representations, 2019 | 44 | 2019 |
| A tight lower bound for high frequency moment estimation with small error Y Li, DP Woodruff Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2013 | 42 | 2013 |
| Distributed partial clustering S Guha, Y Li, Q Zhang ACM Transactions on Parallel Computing (TOPC) 6 (3), 1-20, 2019 | 41 | 2019 |
| For-all Sparse Recovery in Near-Optimal Time AC Gilbert, Y Li, E Porat, MJ Strauss ACM Transactions on Algorithms (TALG) 13 (3), 32:1--32:26, 2017 | 38 | 2017 |
| Tight bounds for sketching the operator norm, schatten norms, and subspace embeddings Y Li, DP Woodruff Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2016 | 37* | 2016 |
| Testing matrix rank, optimally MF Balcan, Y Li, DP Woodruff, H Zhang Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 31 | 2019 |
| Tight bounds for the subspace sketch problem with applications Y Li, R Wang, DP Woodruff SIAM Journal on Computing 50 (4), 1287-1335, 2021 | 21 | 2021 |
| Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order V Braverman, SR Chestnut, R Krauthgamer, Y Li, DP Woodruff, LF Yang Proceedings of Machine Learning Research 80, 648-657, 2018 | 20 | 2018 |
| Embeddings of Schatten Norms with Applications to Data Streams Y Li, DP Woodruff 44th International Colloquium on Automata, Languages, and Programming (ICALP …, 2017 | 19 | 2017 |
| Improved Testing of Low Rank Matrices Y Li, Z Wang, DP Woodruff Proceedings of the 20th ACM SIGKDD international conference on Knowledge …, 2014 | 18 | 2014 |
| Input-sparsity low rank approximation in Schatten norm Y Li, D Woodruff International Conference on Machine Learning, 6001-6009, 2020 | 17 | 2020 |
| On The Communication Complexity of Linear Algebraic Problems in the Message Passing Model Y Li, X Sun, C Wang, DP Woodruff International Symposium on Distributed Computing (DISC), 499--513, 2014 | 16 | 2014 |
| Learning the Positions in CountSketch Y Li, H Lin, S Liu, A Vakilian, D Woodruff International Conference on Learning Representations, 2023 | 14 | 2023 |
| Exponentially improved dimensionality reduction for l1: Subspace embeddings and independence testing Y Li, D Woodruff, T Yasuda Conference on Learning Theory, 3111-3195, 2021 | 13 | 2021 |
David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityGeverifieerd e-mailadres voor cs.cmu.edu
