| Applications of random sampling in computational geometry, II KL Clarkson, PW Shor Discrete & Computational Geometry 4 (5), 387-421, 1989 | 1255 | 1989 |
| Low-rank approximation and regression in input sparsity time KL Clarkson, DP Woodruff Journal of the ACM (JACM) 63 (6), 1-45, 2017 | 556 | 2017 |
| Combinatorial complexity bounds for arrangements of curves and spheres KL Clarkson, H Edelsbrunner, LJ Guibas, M Sharir, E Welzl Discrete & Computational Geometry 5 (2), 99-160, 1990 | 405 | 1990 |
| Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm KL Clarkson ACM Transactions on Algorithms (TALG) 6 (4), 1-30, 2010 | 393 | 2010 |
| New applications of random sampling in computational geometry KL Clarkson Discrete & Computational Geometry 2 (2), 195-222, 1987 | 385 | 1987 |
| Las Vegas algorithms for linear and integer programming when the dimension is small KL Clarkson Journal of the ACM (JACM) 42 (2), 488-499, 1995 | 361* | 1995 |
| A randomized algorithm for closest-point queries KL Clarkson SIAM Journal on Computing 17 (4), 830-847, 1988 | 359* | 1988 |
| Numerical linear algebra in the streaming model KL Clarkson, DP Woodruff Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009 | 318 | 2009 |
| Nearest-neighbor searching and metric space dimensions KL Clarkson Nearest-neighbor methods for learning and vision: theory and practice, 15-59, 2006 | 302 | 2006 |
| Approximation algorithms for shortest path motion planning K Clarkson Proceedings of the nineteenth annual ACM symposium on Theory of computing, 56-65, 1987 | 288 | 1987 |
| Four results on randomized incremental constructions KL Clarkson, K Mehlhorn, R Seidel Computational Geometry 3 (4), 185-212, 1993 | 273 | 1993 |
| Nearest neighbor queries in metric spaces KL Clarkson Discrete & Computational Geometry 22 (1), 63-93, 1999 | 263 | 1999 |
| Improved approximation algorithms for geometric set cover KL Clarkson, K Varadarajan Discrete & Computational Geometry 37 (1), 43-58, 2007 | 250 | 2007 |
| Optimal core-sets for balls M Bădoiu, KL Clarkson Computational Geometry 40 (1), 14-22, 2008 | 233 | 2008 |
| Fast algorithms for the all nearest neighbors problem KL Clarkson 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 226-232, 1983 | 198 | 1983 |
| Smaller core-sets for balls M Badoiu, KL Clarkson SODA 3, 801-802, 2003 | 189 | 2003 |
| An algorithm for approximate closest-point queries KL Clarkson Proceedings of the tenth annual symposium on Computational geometry, 160-164, 1994 | 174 | 1994 |
| Rectilinear shortest paths through polygonal obstacles in O(n(logn)2) time K Clarkson, S Kapoor, P Vaidya Proceedings of the third annual symposium on Computational geometry, 251-257, 1987 | 173 | 1987 |
| Safe and effective determinant evaluation KL Clarkson FOCS 92, 387-395, 1992 | 169 | 1992 |
| Fast linear expected-time algorithms for computing maxima and convex hulls JL Bentley, KL Clarkson, DB Levine Algorithmica 9 (2), 168-183, 1993 | 166 | 1993 |
David WoodruffCarnegie Mellon UniversityVerified email at cs.cmu.edu
