Kenneth L. Clarkson

Available identifiers

zbMath Open clarkson.kenneth-lWikidataQ102389938 ScholiaQ102389938MaRDI QIDQ483773

List of research outcomes

Publication	Date of Publication	Type
Low-rank approximation with 1/𝜖 1/3 matrix-vector products	2023-12-08	Paper
Algorithms for polytope covering and approximation	2023-01-18	Paper
Four results on randomized incremental constructions	2022-08-18	Paper
Sharper Bounds for Regularized Data Fitting	2021-07-28	Paper
Sparse graph based sketching for fast numerical linear algebra	2021-02-10	Paper
Random sampling with removal	2020-10-23	Paper
Projection techniques to update the truncated SVD of evolving matrices	2020-10-13	Paper
Linear programming in \(O(n\times 3^{d^2})\) time	2019-07-08	Paper
The Fast Cauchy Transform and Faster Robust Linear Regression	2019-05-15	Paper
Low-Rank Approximation and Regression in Input Sparsity Time	2018-08-02	Paper
Low-Rank PSD Approximation in Input-Sparsity Time	2018-07-16	Paper
Faster Kernel Ridge Regression Using Sketching and Preconditioning	2017-11-06	Paper
Improved approximation algorithms for geometric set cover	2017-10-20	Paper
On the set multi-cover problem in geometric settings	2017-10-20	Paper
Sketching for M-Estimators: A Unified Approach to Robust Regression	2017-10-05	Paper
The Fast Cauchy Transform and Faster Robust Linear Regression	2016-06-16	Paper
Numerical linear algebra in the streaming model	2015-02-04	Paper
MSTor: a program for calculating partition functions, free energies, enthalpies, entropies, and heat capacities of complex molecules including torsional anharmonicity	2014-12-17	Paper
On the set multicover problem in geometric settings	2014-12-05	Paper
Building triangulations using ε-nets	2014-11-25	Paper
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm	2014-11-18	Paper
https://portal.mardi4nfdi.de/entity/Q2921678	2014-10-13	Paper
Self-improving algorithms for coordinate-wise maxima	2014-08-07	Paper
Low-Rank Approximation and Regression in Input Sparsity Time	2014-08-07	Paper
Self-Improving Algorithms for Coordinatewise Maxima and Convex Hulls	2014-07-30	Paper
https://portal.mardi4nfdi.de/entity/Q5417730	2014-05-22	Paper
Sublinear optimization for machine learning	2014-02-17	Paper
Self-Improving Algorithms	2011-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q3579455	2010-08-06	Paper
Tighter bounds for random projections of manifolds	2009-02-12	Paper
Self-improving algorithms for delaunay triangulations	2009-02-12	Paper
Geometry is everywhere, part XLVII	2009-02-12	Paper
Optimal core-sets for balls	2008-03-26	Paper
Improved approximation algorithms for geometric set cover	2007-02-14	Paper
https://portal.mardi4nfdi.de/entity/Q4471374	2004-07-28	Paper
Fast multiple-antenna differential decoding	2003-07-24	Paper
Nearest neighbor queries in metric spaces	2002-10-13	Paper
https://portal.mardi4nfdi.de/entity/Q4527028	2001-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4230363	1999-11-29	Paper
Las Vegas algorithms for linear and integer programming when the dimension is small	1998-02-02	Paper
APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS	1996-12-16	Paper
https://portal.mardi4nfdi.de/entity/Q3138891	1994-09-19	Paper
A bound on local minima of arrangements that implies the upper bound theorem	1994-01-19	Paper
Four results on randomized incremental constructions	1993-11-01	Paper
https://portal.mardi4nfdi.de/entity/Q3138934	1993-10-20	Paper
Fast linear expected-time algorithms for computing maxima and convex hulls	1993-04-01	Paper
ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS"	1993-04-01	Paper
RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS	1993-01-16	Paper
Combinatorial complexity bounds for arrangements of curves and spheres	1990-01-01	Paper
Applications of random sampling in computational geometry. II	1989-01-01	Paper
A fast Las Vegas algorithm for triangulating a simple polygon	1989-01-01	Paper
An algorithm for geometric minimum spanning trees requiring nearly linear expected time	1989-01-01	Paper
A Randomized Algorithm for Closest-Point Queries	1988-01-01	Paper
Solving related two- and three-dimensional linear programming problems in logarithmic time	1987-01-01	Paper
New applications of random sampling in computational geometry	1987-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Kenneth L. Clarkson