Follow
Kenneth L. Clarkson
Kenneth L. Clarkson
IBM Almaden Research
Verified email at us.ibm.com - Homepage
Title
Cited by
Cited by
Year
Applications of random sampling in computational geometry, II
KL Clarkson
Proceedings of the fourth annual symposium on Computational geometry, 1-11, 1988
14041988
Low-rank approximation and regression in input sparsity time
KL Clarkson, DP Woodruff
Journal of the ACM (JACM) 63 (6), 1-45, 2017
8512017
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
KL Clarkson
ACM Transactions on Algorithms (TALG) 6 (4), 1-30, 2010
5242010
New applications of random sampling in computational geometry
KL Clarkson
Discrete & Computational Geometry 2, 195-222, 1987
4451987
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
4441990
Numerical linear algebra in the streaming model
KL Clarkson, DP Woodruff
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
4242009
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
415*1995
A randomized algorithm for closest-point queries
KL Clarkson
SIAM Journal on Computing 17 (4), 830-847, 1988
399*1988
Approximation algorithms for shortest path motion planning
K Clarkson
Proceedings of the nineteenth annual ACM symposium on Theory of computing, 56-65, 1987
3541987
Nearest-neighbor searching and metric space dimensions
KL Clarkson
3282006
Improved approximation algorithms for geometric set cover
KL Clarkson, K Varadarajan
Proceedings of the twenty-first annual symposium on Computational geometry …, 2005
3002005
Nearest neighbor queries in metric spaces
KL Clarkson
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
2881997
Optimal core-sets for balls
M Bădoiu, KL Clarkson
Computational Geometry 40 (1), 14-22, 2008
2682008
Smaller core-sets for balls
M Badoiu, KL Clarkson
SODA 3, 801-802, 2003
2362003
Four results on randomized incremental constructions
KL Clarkson, K Mehlhorn, R Seidel
Computational Geometry 3 (4), 185-212, 1993
2351993
Fast algorithms for the all nearest neighbors problem
KL Clarkson
24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 226-232, 1983
2271983
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
1991987
An algorithm for approximate closest-point queries
KL Clarkson
Proceedings of the tenth annual symposium on Computational geometry, 160-164, 1994
1971994
Safe and effective determinant evaluation
KL Clarkson
FOCS 92, 387-395, 1992
1831992
Fast linear expected-time algorithms for computing maxima and convex hulls
JL Bentley, KL Clarkson, DB Levine
Algorithmica 9, 168-183, 1993
1801993
The system can't perform the operation now. Try again later.
Articles 1–20