Kenneth L. Clarkson 个人学术档案

引用次数

	总计	2019 年至今
引用	11363	3157
h 指数	46	30
i10 指数	75	52

600

300

150

450

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202465 94 106 162 171 176 190 182 159 196 179 151 179 178 139 153 228 237 222 308 296 322 359 330 383 437 501 410 460 546 491 519 598 575 577 575 312

开放获取的出版物数量

查看全部

14 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

David WoodruffProfessor of Computer Science, Carnegie Mellon University在 cs.cmu.edu 的电子邮件经过验证
Lior HoreshIBM TJ Watson Research Center | Columbia University在 us.ibm.com 的电子邮件经过验证
Shashanka UbaruIBM Research在 ibm.com 的电子邮件经过验证
Leonidas GuibasProfessor of Computer Science, Stanford University在 cs.stanford.edu 的电子邮件经过验证
Herbert EdelsbrunnerProfessor of Mathematics, IST Austria在 ist.ac.at 的电子邮件经过验证
Haim AvronAssociate Professor, Tel Aviv University在 tauex.tau.ac.il 的电子邮件经过验证
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics Campus在 mpi-inf.mpg.de 的电子邮件经过验证
p polakosCisco Systems; Einblick LLC在 cisco.com 的电子邮件经过验证
Micha SharirTel Aviv University在 tauex.tau.ac.il 的电子邮件经过验证
Vassilis KalantzisIBM Research在 ibm.com 的电子邮件经过验证
Robert TarjanProfessor of Computer Science, Princeton University在 cs.princeton.edu 的电子邮件经过验证
Raimund SeidelProfessor, Saarland University, Saarbrücken; Saarland Informatics Campus;Schloss Dagstuhl - LZI在 cs.uni-saarland.de 的电子邮件经过验证
Mihai BadoiuEdgestream Partners LP在 theory.csail.mit.edu 的电子邮件经过验证
C. SeshadhriUniversity of California, Santa Cruz在 ucsc.edu 的电子邮件经过验证
Michael MahoneyProfessor of Statistics, UC Berkeley在 stat.berkeley.edu 的电子邮件经过验证
Donald TruhlarUniversity of Minnesota在 umn.edu 的电子邮件经过验证
Richard ColeProfessor of Computer Science, Courant Institute, New York University在 cs.nyu.edu 的电子邮件经过验证
Wim SweldensBell Labs / Alcatel-Lucent / Sweldens Innovations / Kiswe Inc.在 sweldens.com 的电子邮件经过验证
Elad HazanProfessor at Princeton University and Director Google AI Princeton在 princeton.edu 的电子邮件经过验证
Kasturi VaradarajanProfessor of Computer Science, University of Iowa在 uiowa.edu 的电子邮件经过验证

关注

Kenneth L. Clarkson

IBM Almaden Research

在 us.ibm.com 的电子邮件经过验证 - 首页

Algorithms


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Applications of random sampling in computational geometry, II KL Clarkson Proceedings of the fourth annual symposium on Computational geometry, 1-11, 1988	1402	1988
Low-rank approximation and regression in input sparsity time KL Clarkson, DP Woodruff Journal of the ACM (JACM) 63 (6), 1-45, 2017	848	2017
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm KL Clarkson ACM Transactions on Algorithms (TALG) 6 (4), 1-30, 2010	521	2010
New applications of random sampling in computational geometry KL Clarkson Discrete & Computational Geometry 2, 195-222, 1987	457	1987
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	439	1990
Numerical linear algebra in the streaming model KL Clarkson, DP Woodruff Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009	422	2009
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	413*	1995
A randomized algorithm for closest-point queries KL Clarkson SIAM Journal on Computing 17 (4), 830-847, 1988	393*	1988
Approximation algorithms for shortest path motion planning K Clarkson Proceedings of the nineteenth annual ACM symposium on Theory of computing, 56-65, 1987	350	1987
Nearest-neighbor searching and metric space dimensions KL Clarkson	330	2006
Improved approximation algorithms for geometric set cover KL Clarkson, K Varadarajan Proceedings of the twenty-first annual symposium on Computational geometry …, 2005	299	2005
Nearest neighbor queries in metric spaces KL Clarkson Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997	288	1997
Optimal core-sets for balls M Bădoiu, KL Clarkson Computational Geometry 40 (1), 14-22, 2008	269	2008
Four results on randomized incremental constructions KL Clarkson, K Mehlhorn, R Seidel Computational Geometry 3 (4), 185-212, 1993	236	1993
Smaller core-sets for balls M Badoiu, KL Clarkson SODA 3, 801-802, 2003	235	2003
Fast algorithms for the all nearest neighbors problem KL Clarkson 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 226-232, 1983	228	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	201	1987
An algorithm for approximate closest-point queries KL Clarkson Proceedings of the tenth annual symposium on Computational geometry, 160-164, 1994	199	1994
Safe and effective determinant evaluation KL Clarkson FOCS 92, 387-395, 1992	183	1992
Fast linear expected-time algorithms for computing maxima and convex hulls JL Bentley, KL Clarkson, DB Levine Algorithmica 9, 168-183, 1993	180	1993

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用