| Path finding methods for linear programming: Solving linear programs in o (vrank) iterations and faster algorithms for maximum flow YT Lee, A Sidford 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, 424-433, 2014 | 364* | 2014 |
| Optimal algorithms for smooth and strongly convex distributed optimization in networks K Scaman, F Bach, S Bubeck, YT Lee, L Massoulié international conference on machine learning, 3027-3036, 2017 | 284 | 2017 |
| An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations JA Kelner, YT Lee, L Orecchia, A Sidford Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014 | 284 | 2014 |
| A faster cutting plane method and its implications for combinatorial and convex optimization YT Lee, A Sidford, SC Wong 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1049-1065, 2015 | 273 | 2015 |
| Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems YT Lee, A Sidford 2013 ieee 54th annual symposium on foundations of computer science, 147-156, 2013 | 266 | 2013 |
| Solving linear programs in the current matrix multiplication time MB Cohen, YT Lee, Z Song Journal of the ACM (JACM) 68 (1), 1-39, 2021 | 243 | 2021 |
| Uniform sampling for matrix approximation MB Cohen, YT Lee, C Musco, C Musco, R Peng, A Sidford Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015 | 214 | 2015 |
| Adversarial examples from computational constraints S Bubeck, YT Lee, E Price, I Razenshteyn International Conference on Machine Learning, 831-840, 2019 | 205 | 2019 |
| A geometric alternative to Nesterov's accelerated gradient descent S Bubeck, YT Lee, M Singh arXiv preprint arXiv:1506.08187, 2015 | 173 | 2015 |
| Optimal algorithms for non-smooth distributed optimization in networks K Scaman, F Bach, S Bubeck, L Massoulié, YT Lee Advances in Neural Information Processing Systems 31, 2018 | 161 | 2018 |
| Single pass spectral sparsification in dynamic streams M Kapralov, YT Lee, CN Musco, CP Musco, A Sidford SIAM Journal on Computing 46 (1), 456-477, 2017 | 154 | 2017 |
| Geometric median in nearly linear time MB Cohen, YT Lee, G Miller, J Pachocki, A Sidford Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 152 | 2016 |
| Kernel-based methods for bandit convex optimization S Bubeck, YT Lee, R Eldan Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing …, 2017 | 144 | 2017 |
| Sparsified cholesky and multigrid solvers for connection laplacians R Kyng, YT Lee, R Peng, S Sachdeva, DA Spielman Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 140* | 2016 |
| Efficient Inverse Maintenance and Faster Algorithms for Linear Programming YT Lee, A Sidford arXiv preprint arXiv:1503.01752, 2015 | 136 | 2015 |
| A new approach to computing maximum flows using electrical flows YT Lee, S Rao, N Srivastava Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 112 | 2013 |
| Constructing linear-sized spectral sparsification in almost-linear time YT Lee, H Sun SIAM Journal on Computing 47 (6), 2315-2336, 2018 | 99 | 2018 |
| Convergence rate of Riemannian Hamiltonian Monte Carlo and faster polytope volume computation YT Lee, SS Vempala Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 97 | 2018 |
| Minimum cost flows, MDPs, and ℓ1-regression in nearly linear time for dense instances J Van Den Brand, YT Lee, YP Liu, T Saranurak, A Sidford, Z Song, ... Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 85 | 2021 |
| An sdp-based algorithm for linear-sized spectral sparsification YT Lee, H Sun Proceedings of the 49th annual acm sigact symposium on theory of computing …, 2017 | 83 | 2017 |
Aaron SidfordStanford UniversityVerified email at stanford.edu
