Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDKenneth L. Clarkson
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[i18]Kenneth L. Clarkson, Sanjana Sahayaraj:
Order Embeddings from Merged Ontologies using Sketching. CoRR abs/2101.02158 (2021)- [i17]Dong Hu, Shashanka Ubaru, Alex Gittens, Kenneth L. Clarkson, Lior Horesh, Vassilis Kalantzis:
Sparse graph based sketching for fast numerical linear algebra. CoRR abs/2102.05758 (2021) - 2020
- [j34]Kenneth L. Clarkson, Bernd Gärtner, Johannes Lengler, May Szedlák:
Random Sampling with Removal. Discret. Comput. Geom. 64(3): 700-733 (2020) - [i16]Vassilis Kalantzis, Georgios Kollias, Shashanka Ubaru, Athanasios N. Nikolakopoulos, Lior Horesh, Kenneth L. Clarkson:
Projection techniques to update the truncated SVD of evolving matrices. CoRR abs/2010.06392 (2020) - [i15]Nadiia Chepurko, Kenneth L. Clarkson, Lior Horesh, David P. Woodruff:
Quantum-Inspired Algorithms from Randomized Numerical Linear Algebra. CoRR abs/2011.04125 (2020)
2010 – 2019
- 2019
- [c44]Michal Derezinski, Kenneth L. Clarkson, Michael W. Mahoney, Manfred K. Warmuth:
Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression. COLT 2019: 1050-1069 - [c43]Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff:
Dimensionality Reduction for Tukey Regression. ICML 2019: 1262-1271 - [i14]Michal Derezinski, Kenneth L. Clarkson, Michael W. Mahoney, Manfred K. Warmuth:
Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression. CoRR abs/1902.00995 (2019) - [i13]Kenneth L. Clarkson, Ruosong Wang, David P. Woodruff:
Dimensionality Reduction for Tukey Regression. CoRR abs/1905.05376 (2019) - 2018
- [i12]Stephen Boyer, Thomas D. Griffin, Sarath Swaminathan, Kenneth L. Clarkson, Dmitry Zubarev:
Data Infrastructure and Approaches for Ontology-Based Drug Repurposing. CoRR abs/1807.09754 (2018) - 2017
- [j33]Haim Avron, Kenneth L. Clarkson, David P. Woodruff:
Faster Kernel Ridge Regression Using Sketching and Preconditioning. SIAM J. Matrix Anal. Appl. 38(4): 1116-1138 (2017) - [c42]Haim Avron, Kenneth L. Clarkson, David P. Woodruff:
Sharper Bounds for Regularized Data Fitting. APPROX-RANDOM 2017: 27:1-27:22 - [c41]Kenneth L. Clarkson, David P. Woodruff:
Low-Rank PSD Approximation in Input-Sparsity Time. SODA 2017: 2061-2072 - 2016
- [j32]Kenneth L. Clarkson, János Pach, Günter M. Ziegler:
Thirtieth Anniversary Note from the Editors in Chief. Discret. Comput. Geom. 55(4): 745-747 (2016) - [j31]Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff:
The Fast Cauchy Transform and Faster Robust Linear Regression. SIAM J. Comput. 45(3): 763-810 (2016) - [i11]Haim Avron, Kenneth L. Clarkson, David P. Woodruff:
Faster Kernel Ridge Regression Using Sketching and Preconditioning. CoRR abs/1611.03220 (2016) - [i10]Haim Avron, Kenneth L. Clarkson, David P. Woodruff:
Sharper Bounds for Regression and Low-Rank Approximation with Regularization. CoRR abs/1611.03225 (2016) - 2015
- [c40]Kenneth L. Clarkson, David P. Woodruff:
Input Sparsity and Hardness for Robust Subspace Approximation. FOCS 2015: 310-329 - [c39]Kenneth L. Clarkson, David P. Woodruff:
Sketching for M-Estimators: A Unified Approach to Robust Regression. SODA 2015: 921-939 - [i9]Kenneth L. Clarkson, David P. Woodruff:
Input Sparsity and Hardness for Robust Subspace Approximation. CoRR abs/1510.06073 (2015) - 2014
- [j30]Kenneth L. Clarkson, Wolfgang Mulzer
, C. Seshadhri:
Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls. SIAM J. Comput. 43(2): 617-653 (2014) - 2013
- [c38]Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff:
The Fast Cauchy Transform and Faster Robust Linear Regression. SODA 2013: 466-477 - [c37]Kenneth L. Clarkson, David P. Woodruff:
Low rank approximation and regression in input sparsity time. STOC 2013: 81-90 - 2012
- [j29]Jingjing Zheng, Steven L. Mielke, Kenneth L. Clarkson, Donald G. Truhlar:
MSTor: A program for calculating partition functions, free energies, enthalpies, entropies, and heat capacities of complex molecules including torsional anharmonicity. Comput. Phys. Commun. 183(8): 1803-1812 (2012) - [j28]Kenneth L. Clarkson, Elad Hazan, David P. Woodruff:
Sublinear optimization for machine learning. J. ACM 59(5): 23:1-23:49 (2012) - [j27]Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the set multicover problem in geometric settings. ACM Trans. Algorithms 9(1): 9:1-9:17 (2012) - [c36]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving algorithms for coordinate-wise maxima. Symposium on Computational Geometry 2012: 277-286 - [i8]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving Algorithms for Coordinate-wise Maxima. CoRR abs/1204.0824 (2012) - [i7]Kenneth L. Clarkson, Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, Xiangrui Meng, David P. Woodruff:
The Fast Cauchy Transform: with Applications to Basis Construction, Regression, and Subspace Approximation in L1. CoRR abs/1207.4684 (2012) - [i6]Kenneth L. Clarkson, David P. Woodruff:
Low Rank Approximation and Regression in Input Sparsity Time. CoRR abs/1207.6365 (2012) - [i5]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving Algorithms for Coordinate-Wise Maxima and Convex Hulls. CoRR abs/1211.0952 (2012) - 2011
- [j26]Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms. SIAM J. Comput. 40(2): 350-375 (2011) - 2010
- [b1]Kenneth L. Clarkson, Micha Sharir:
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (reprint). General Books 2010, ISBN 978-1-153-46242-6, pp. 1-49 - [j25]Kenneth L. Clarkson, Günter Rote:
Welcome from the Editors-in-Chief. J. Comput. Geom. 1(1): 1-2 (2010) - [j24]Kenneth L. Clarkson:
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Trans. Algorithms 6(4): 63:1-63:30 (2010) - [c35]Kenneth L. Clarkson, Elad Hazan, David P. Woodruff:
Sublinear Optimization for Machine Learning. FOCS 2010: 449-457 - [c34]Barna Saha, Ioana Stanoi, Kenneth L. Clarkson:
Schema covering: a step towards enabling reuse in information integration. ICDE 2010: 285-296 - [c33]Kenneth L. Clarkson, Wolfgang Mulzer, C. Seshadhri:
Self-improving Algorithms for Convex Hulls. SODA 2010: 1546-1565 - [p1]Kenneth L. Clarkson, Kun Liu, Evimaria Terzi:
Toward Identity Anonymization in Social Networks. Link Mining 2010: 359-385 - [i4]Kenneth L. Clarkson, Elad Hazan, David P. Woodruff:
Sublinear Optimization for Machine Learning. CoRR abs/1010.4408 (2010)
2000 – 2009
- 2009
- [c32]Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the set multi-cover problem in geometric settings. Symposium on Computational Geometry 2009: 341-350 - [c31]Kenneth L. Clarkson, David P. Woodruff:
Numerical linear algebra in the streaming model. STOC 2009: 205-214 - [i3]Nir Ailon, Bernard Chazelle, Kenneth L. Clarkson, Ding Liu, Wolfgang Mulzer, C. Seshadhri:
Self-Improving Algorithms. CoRR abs/0907.0884 (2009) - [i2]Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-Peled:
On the Set Multi-Cover Problem in Geometric Settings. CoRR abs/0909.0537 (2009) - 2008
- [j23]Mihai Badoiu, Kenneth L. Clarkson:
Optimal core-sets for balls. Comput. Geom. 40(1): 14-22 (2008) - [c30]Kenneth L. Clarkson:
Tighter bounds for random projections of manifolds. Symposium on Computational Geometry 2008: 39-48 - [c29]Kenneth L. Clarkson, C. Seshadhri:
Self-improving algorithms for delaunay triangulations. Symposium on Computational Geometry 2008: 148-155 - [c28]Kenneth L. Clarkson:
Geometry is everywhere, part XLVII: metrics, nets, dimensions, and measures. Symposium on Computational Geometry 2008: 305 - [c27]Kenneth L. Clarkson:
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. SODA 2008: 922-931 - 2007
- [j22]Kenneth L. Clarkson, Kasturi R. Varadarajan:
Improved Approximation Algorithms for Geometric Set Cover. Discret. Comput. Geom. 37(1): 43-58 (2007) - [c26]Kenneth L. Clarkson, Georg K. Hampel, John D. Hobby:
Modeling UpLink Power Control with Outage Probabilities. VTC Fall 2007: 799-803 - [c25]Kenneth L. Clarkson, John D. Hobby:
Ocelot's Knapsack Calculations for Modeling Power Amplifier and Walsh Code Limits. VTC Fall 2007: 905-909 - 2006
- [c24]Kenneth L. Clarkson:
Building triangulations using epsilon-nets. STOC 2006: 326-335 - 2005
- [c23]Kenneth L. Clarkson, Kasturi R. Varadarajan:
Improved approximation algorithms for geometric set cover. Symposium on Computational Geometry 2005: 135-141 - [i1]Kenneth L. Clarkson, Kasturi R. Varadarajan:
Improved Approximation Algorithms for Geometric Set Cover. CoRR abs/cs/0501045 (2005) - 2003
- [j21]Simon C. Borst, Kenneth L. Clarkson, John M. Graybeal, Harish Viswanathan, Philip A. Whiting:
User-level QoS and traffic engineering for 3G wireless 1xEV-DO systems. Bell Labs Tech. J. 8(2): 33-47 (2003) - [c22]Mihai Badoiu, Kenneth L. Clarkson:
Smaller core-sets for balls. SODA 2003: 801-802 - 2001
- [j20]Kenneth L. Clarkson, Wim Sweldens, Alice Zheng:
Fast multiple-antenna differential decoding. IEEE Trans. Commun. 49(2): 253-261 (2001)
1990 – 1999
- 1999
- [j19]Kenneth L. Clarkson:
Nearest Neighbor Queries in Metric Spaces. Discret. Comput. Geom. 22(1): 63-93 (1999) - [j18]Kenneth L. Clarkson:
Guest Editor's Foreword. Discret. Comput. Geom. 22(4): 479-480 (1999) - 1998
- [j17]Kenneth L. Clarkson:
SODA '95 Papers. J. Algorithms 29(2): 203 (1998) - 1997
- [c21]Kenneth L. Clarkson:
Nearest Neighbor Queries in Metric Spaces. STOC 1997: 609-617 - 1996
- [j16]Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng:
Approximating center points with iterative Radon points. Int. J. Comput. Geom. Appl. 6(3): 357-377 (1996) - 1995
- [j15]Kenneth L. Clarkson:
Las Vegas Algorithms for Linear and Integer Programming when the Dimension is Small. J. ACM 42(2): 488-499 (1995) - [e1]Kenneth L. Clarkson:
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 22-24 January 1995. San Francisco, California, USA. ACM/SIAM 1995, ISBN 0-89871-349-8 [contents] - 1994
- [c20]Kenneth L. Clarkson:
An Algorithm for Approximate Closest-Point Queries. Symposium on Computational Geometry 1994: 160-164 - [c19]Kenneth L. Clarkson:
More Output-Sensitive Geometric Algorithms (Extended Abstract). FOCS 1994: 695-702 - 1993
- [j14]Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine:
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. Algorithmica 9(2): 168-183 (1993) - [j13]Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel:
Four Results on Randomized Incremental Constructions. Comput. Geom. 3: 185-212 (1993) - [j12]Kenneth L. Clarkson:
A Bound on Local Minima of Arrangements that Implies the Upper Bound Theorem. Discret. Comput. Geom. 10: 427-433 (1993) - [c18]Kenneth L. Clarkson, David Eppstein, Gary L. Miller, Carl Sturtivant, Shang-Hua Teng:
Approximating Center Points with Iterated Radon Points. Symposium on Computational Geometry 1993: 91-98 - [c17]Kenneth L. Clarkson:
Algorithms for Polytope Covering and Approximation. WADS 1993: 246-252 - 1992
- [j11]Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. 2(2): 117-133 (1992) - [j10]Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Erratum: Randomized parallel algorithms for trapezoidal diagrams. Int. J. Comput. Geom. Appl. 2(3): 341-343 (1992) - [c16]Kenneth L. Clarkson:
Safe and Effective Determinant Evaluation. FOCS 1992: 387-395 - [c15]Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel:
Four Results on Randomized Incremental Constructions. STACS 1992: 463-474 - 1991
- [c14]Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan:
Randomized Parallel Algorithms for Trapezoidal Diagrams. Symposium on Computational Geometry 1991: 152-161 - [c13]Kenneth L. Clarkson:
Approximation Algorithms for Planar Traveling Salesman Tours and Minimum-Length Triangulations. SODA 1991: 17-23 - 1990
- [j9]Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discret. Comput. Geom. 5: 99-160 (1990) - [c12]Jon Louis Bentley, Kenneth L. Clarkson, David B. Levine:
Fast Linear Expected-Time Algorithms for Computing Maxima and Convex Hulls. SODA 1990: 179-187
1980 – 1989
- 1989
- [j8]Kenneth L. Clarkson:
An Algorithm for Geometric Minimum Spanning Trees Requiring Nearly Linear Expected Time. Algorithmica 4(4): 461-469 (1989) - [j7]Kenneth L. Clarkson, Peter W. Shor:
Application of Random Sampling in Computational Geometry, II. Discret. Comput. Geom. 4: 387-421 (1989) - [j6]Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk:
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. Discret. Comput. Geom. 4: 423-432 (1989) - 1988
- [j5]Kenneth L. Clarkson:
A Randomized Algorithm for Closest-Point Queries. SIAM J. Comput. 17(4): 830-847 (1988) - [c11]Kenneth L. Clarkson:
Applications of Random Sampling in Computational Geometry, II. Symposium on Computational Geometry 1988: 1-11 - [c10]Kenneth L. Clarkson, Peter W. Shor:
Algorithms for Diametral Pairs and Convex Hulls That Are Optimal, Randomized, and Incremental. Symposium on Computational Geometry 1988: 12-17 - [c9]Kenneth L. Clarkson, Robert Endre Tarjan, Christopher J. Van Wyk:
A Fast Las Vegas Algorithm for Triangulating a Simple Polygon. Symposium on Computational Geometry 1988: 18-22 - [c8]Kenneth L. Clarkson:
A Las Vegas Algorithm for Linear Programming When the Dimension Is Small. FOCS 1988: 452-456 - [c7]Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces. FOCS 1988: 568-579 - 1987
- [j4]Kenneth L. Clarkson:
New Applications of random Sampling in Computational Geometry. Discret. Comput. Geom. 2: 195-222 (1987) - [j3]Leonidas J. Guibas, Jorge Stolfi, Kenneth L. Clarkson:
Solving Related Two-and Three-Dimensional Linear Programming Problems in Logarithmic Time. Theor. Comput. Sci. 49: 81-84 (1987) - [c6]Kenneth L. Clarkson, Sanjiv Kapoor, Pravin M. Vaidya:
Rectilinear Shortest Paths Through Polygonal Obstacles in O(n (log n)2) Time. Symposium on Computational Geometry 1987: 251-257 - [c5]Kenneth L. Clarkson:
Approximation Algorithms for Shortest Path Motion Planning (Extended Abstract). STOC 1987: 56-65 - 1986
- [j2]Kenneth L. Clarkson:
Linear Programming in O(n * (3_d)_2) Time. Inf. Process. Lett. 22(1): 21-24 (1986) - [c4]Kenneth L. Clarkson:
Further Applications of Random Sampling to Computational Geometry. STOC 1986: 414-423 - 1985
- [c3]Kenneth L. Clarkson:
A Probabilistic Algorithm for the Post Office Problem. STOC 1985: 175-184 - 1984
- [c2]Kenneth L. Clarkson:
Fast Expected-Time and Approximation Algorithms for Geometric Minimum Spanning Trees (Extended Abstract). STOC 1984: 342-348 - 1983
- [j1]Kenneth L. Clarkson:
A Modification of the Greedy Algorithm for Vertex Cover. Inf. Process. Lett. 16(1): 23-25 (1983) - [c1]Kenneth L. Clarkson:
Fast Algorithms for the All Nearest Neighbors Problem. FOCS 1983: 226-232
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-02-19 22:51 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
