The following pages link to Kenneth L. Clarkson (Q483773):
Displayed 50 items.
- MSTor: a program for calculating partition functions, free energies, enthalpies, entropies, and heat capacities of complex molecules including torsional anharmonicity (Q483775) (← links)
- Four results on randomized incremental constructions (Q686138) (← links)
- Improved approximation algorithms for geometric set cover (Q866970) (← links)
- Item:Q483773 (redirect page) (← links)
- Combinatorial complexity bounds for arrangements of curves and spheres (Q917017) (← links)
- Solving related two- and three-dimensional linear programming problems in logarithmic time (Q1091934) (← links)
- Fast linear expected-time algorithms for computing maxima and convex hulls (Q1206440) (← links)
- Item:Q483773 (redirect page) (← links)
- Nearest neighbor queries in metric spaces (Q1293352) (← links)
- A bound on local minima of arrangements that implies the upper bound theorem (Q1312194) (← links)
- New applications of random sampling in computational geometry (Q1820582) (← links)
- Applications of random sampling in computational geometry. II (Q1823685) (← links)
- A fast Las Vegas algorithm for triangulating a simple polygon (Q1823686) (← links)
- An algorithm for geometric minimum spanning trees requiring nearly linear expected time (Q1824386) (← links)
- Linear programming in \(O(n\times 3^{d^2})\) time (Q2003407) (← links)
- Random sampling with removal (Q2207595) (← links)
- Optimal core-sets for balls (Q2479470) (← links)
- The Fast Cauchy Transform and Faster Robust Linear Regression (Q2812147) (← links)
- Self-improving algorithms for coordinate-wise maxima (Q2874589) (← links)
- (Q2921678) (← links)
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm (Q2930345) (← links)
- Building triangulations using ε-nets (Q2931397) (← links)
- On the set multicover problem in geometric settings (Q2933638) (← links)
- Self-Improving Algorithms (Q3020010) (← links)
- (Q3138891) (← links)
- (Q3138934) (← links)
- Low-Rank Approximation and Regression in Input Sparsity Time (Q3177880) (← links)
- (Q3579455) (← links)
- Tighter bounds for random projections of manifolds (Q3602900) (← links)
- Self-improving algorithms for delaunay triangulations (Q3602908) (← links)
- Geometry is everywhere, part XLVII (Q3602932) (← links)
- A Randomized Algorithm for Closest-Point Queries (Q3796754) (← links)
- RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS (Q4017519) (← links)
- ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS" (Q4030354) (← links)
- (Q4230363) (← links)
- Las Vegas algorithms for linear and integer programming when the dimension is small (Q4369872) (← links)
- (Q4471374) (← links)
- (Q4527028) (← links)
- Fast multiple-antenna differential decoding (Q4552899) (← links)
- Low-Rank PSD Approximation in Input-Sparsity Time (Q4575882) (← links)
- Faster Kernel Ridge Regression Using Sketching and Preconditioning (Q4588937) (← links)
- Sharper Bounds for Regularized Data Fitting (Q5002630) (← links)
- Algorithms for polytope covering and approximation (Q5060117) (← links)
- Four results on randomized incremental constructions (Q5096803) (← links)
- Numerical linear algebra in the streaming model (Q5172714) (← links)
- Sketching for <i>M</i>-Estimators: A Unified Approach to Robust Regression (Q5363041) (← links)
- Improved approximation algorithms for geometric set cover (Q5370605) (← links)
- On the set multi-cover problem in geometric settings (Q5370734) (← links)
- Sublinear optimization for machine learning (Q5395692) (← links)
- (Q5417730) (← links)