Kenneth L. Clarkson

Citado por

	Total	Desde 2018
Citas	10719	3053
Índice h	46	30
Índice i10	68	48

640

320

160

480

19881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202363 90 100 160 178 173 173 191 151 195 174 147 175 185 138 155 213 262 218 302 294 314 363 328 382 440 497 408 461 544 487 515 595 581 633 240

Acceso público

Ver todo

13 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

David WoodruffProfessor of Computer Science, Carnegie Mellon UniversityDirección de correo verificada de cs.cmu.edu
Lior HoreshIBM TJ Watson Research Center | Columbia UniversityDirección de correo verificada de us.ibm.com
Leonidas GuibasProfessor of Computer Science, Stanford UniversityDirección de correo verificada de cs.stanford.edu
Herbert EdelsbrunnerProfessor of Mathematics, IST AustriaDirección de correo verificada de ist.ac.at
p polakosCisco Systems; Einblick LLCDirección de correo verificada de cisco.com
Micha SharirTel Aviv UniversityDirección de correo verificada de tauex.tau.ac.il
Haim AvronAssociate Professor, Tel Aviv UniversityDirección de correo verificada de tauex.tau.ac.il
Robert TarjanProfessor of Computer Science, Princeton UniversityDirección de correo verificada de cs.princeton.edu
Mihai BadoiuEdgestream Partners LPDirección de correo verificada de theory.csail.mit.edu
C. SeshadhriUniversity of California, Santa CruzDirección de correo verificada de ucsc.edu
Michael MahoneyProfessor of Statistics, UC BerkeleyDirección de correo verificada de stat.berkeley.edu
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusDirección de correo verificada de mpi-inf.mpg.de
Shashanka UbaruIBM ResearchDirección de correo verificada de umn.edu
Donald TruhlarUniversity of MinnesotaDirección de correo verificada de umn.edu
Richard ColeProfessor of Computer Science, Courant Institute, New York UniversityDirección de correo verificada de cs.nyu.edu
Wim SweldensBell Labs / Alcatel-Lucent / Sweldens Innovations / Kiswe Inc.Dirección de correo verificada de sweldens.com
Elad HazanProfessor at Princeton University and Director Google AI PrincetonDirección de correo verificada de princeton.edu
Raimund SeidelProfessor, Saarland University, Saarbrücken; Saarland Informatics Campus;Schloss Dagstuhl - LZIDirección de correo verificada de cs.uni-saarland.de
Kasturi VaradarajanProfessor of Computer Science, University of IowaDirección de correo verificada de uiowa.edu
Xiangrui MengDatabricksDirección de correo verificada de databricks.com

Seguir

Kenneth L. Clarkson

IBM Almaden Research

Dirección de correo verificada de us.ibm.com - Página principal

Algorithms


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
Applications of random sampling in computational geometry, II KL Clarkson Proceedings of the fourth annual symposium on Computational geometry, 1-11, 1988	1366	1988
Low-rank approximation and regression in input sparsity time KL Clarkson, DP Woodruff Journal of the ACM (JACM) 63 (6), 1-45, 2017	750	2017
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm KL Clarkson ACM Transactions on Algorithms (TALG) 6 (4), 1-30, 2010	489	2010
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	431	1990
New applications of random sampling in computational geometry KL Clarkson Discrete & Computational Geometry 2, 195-222, 1987	427	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	406*	1995
Numerical linear algebra in the streaming model KL Clarkson, DP Woodruff Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009	385	2009
A randomized algorithm for closest-point queries KL Clarkson SIAM Journal on Computing 17 (4), 830-847, 1988	382*	1988
Approximation algorithms for shortest path motion planning K Clarkson Proceedings of the nineteenth annual ACM symposium on Theory of computing, 56-65, 1987	335	1987
Nearest-neighbor searching and metric space dimensions KL Clarkson Nearest-neighbor methods for learning and vision: theory and practice, 15-59, 2006	324	2006
Four results on randomized incremental constructions KL Clarkson, K Mehlhorn, R Seidel STACS 92: 9th Annual Symposium on Theoretical Aspects of Computer Science …, 1992	292	1992
Improved approximation algorithms for geometric set cover KL Clarkson, K Varadarajan Proceedings of the twenty-first annual symposium on Computational geometry …, 2005	281	2005
Nearest neighbor queries in metric spaces KL Clarkson Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997	278	1997
Optimal core-sets for balls M Bădoiu, KL Clarkson Computational Geometry 40 (1), 14-22, 2008	263	2008
Smaller core-sets for balls M Badoiu, KL Clarkson SODA 3, 801-802, 2003	222	2003
Fast algorithms for the all nearest neighbors problem KL Clarkson 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 226-232, 1983	220	1983
Rectilinear shortest paths through polygonal obstacles in O(n(logn)²) time K Clarkson, S Kapoor, P Vaidya Proceedings of the third annual symposium on Computational geometry, 251-257, 1987	199	1987
An algorithm for approximate closest-point queries KL Clarkson Proceedings of the tenth annual symposium on Computational geometry, 160-164, 1994	197	1994
Fast linear expected-time algorithms for computing maxima and convex hulls JL Bentley, KL Clarkson, DB Levine Algorithmica 9, 168-183, 1993	177	1993
Safe and effective determinant evaluation KL Clarkson FOCS 92, 387-395, 1992	177	1992

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores