| Publication | Date of Publication | Type |
|---|
| Near-optimal algorithms for linear algebra in the current matrix multiplication time | 2024-07-19 | Paper |
Low-rank approximation with 1/𝜖 1/3 matrix-vector products
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Algorithms for polytope covering and approximation
Lecture Notes in Computer Science | 2023-01-18 | Paper |
Four results on randomized incremental constructions
STACS 92 | 2022-08-18 | Paper |
Sharper bounds for regularized data fitting
(available as arXiv preprint) | 2021-07-28 | Paper |
| Sparse graph based sketching for fast numerical linear algebra | 2021-02-10 | Paper |
Random sampling with removal
Discrete & Computational Geometry | 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
Information Processing Letters | 2019-07-08 | Paper |
The fast Cauchy transform and faster robust linear regression
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Low-rank approximation and regression in input sparsity time
Journal of the ACM | 2018-08-02 | Paper |
Low-Rank PSD Approximation in Input-Sparsity Time
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Faster kernel ridge regression using sketching and preconditioning
SIAM Journal on Matrix Analysis and Applications | 2017-11-06 | Paper |
Improved approximation algorithms for geometric set cover
Proceedings of the twenty-first annual symposium on Computational geometry | 2017-10-20 | Paper |
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Sketching for M-Estimators: A Unified Approach to Robust Regression
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
The fast Cauchy transform and faster robust linear regression
SIAM Journal on Computing | 2016-06-16 | Paper |
Numerical linear algebra in the streaming model
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
MSTor: a program for calculating partition functions, free energies, enthalpies, entropies, and heat capacities of complex molecules including torsional anharmonicity
Computer Physics Communications | 2014-12-17 | Paper |
On the set multicover problem in geometric settings
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Building triangulations using \({\epsilon}\)-nets
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
ACM Transactions on Algorithms | 2014-11-18 | Paper |
| Subgradient and sampling algorithms for \(\ell_1\) regression | 2014-10-13 | Paper |
Self-improving algorithms for coordinate-wise maxima
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Self-improving algorithms for coordinate-wise maxima
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Low rank approximation and regression in input sparsity time
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Self-improving algorithms for coordinatewise maxima and convex hulls
SIAM Journal on Computing | 2014-07-30 | Paper |
| Self-improving algorithms for convex hulls | 2014-05-22 | Paper |
Sublinear optimization for machine learning
Journal of the ACM | 2014-02-17 | Paper |
Self-improving algorithms
SIAM Journal on Computing | 2011-07-29 | Paper |
| scientific article; zbMATH DE number 5764862 (Why is no real title available?) | 2010-08-06 | Paper |
Tighter bounds for random projections of manifolds
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Self-improving algorithms for delaunay triangulations
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Geometry is everywhere, part XLVII
Proceedings of the twenty-fourth annual symposium on Computational geometry | 2009-02-12 | Paper |
Optimal core-sets for balls
Computational Geometry | 2008-03-26 | Paper |
Improved approximation algorithms for geometric set cover
Discrete & Computational Geometry | 2007-02-14 | Paper |
| scientific article; zbMATH DE number 2079414 (Why is no real title available?) | 2004-07-28 | Paper |
Fast multiple-antenna differential decoding
IEEE Transactions on Communications | 2003-07-24 | Paper |
Nearest neighbor queries in metric spaces
Discrete & Computational Geometry | 2002-10-13 | Paper |
| scientific article; zbMATH DE number 1559576 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1256676 (Why is no real title available?) | 1999-11-29 | Paper |
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM | 1998-02-02 | Paper |
APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
International Journal of Computational Geometry & Applications | 1996-12-16 | Paper |
| scientific article; zbMATH DE number 432763 (Why is no real title available?) | 1994-09-19 | Paper |
A bound on local minima of arrangements that implies the upper bound theorem
Discrete & Computational Geometry | 1994-01-19 | Paper |
Four results on randomized incremental constructions
Computational Geometry | 1993-11-01 | Paper |
| scientific article; zbMATH DE number 432801 (Why is no real title available?) | 1993-10-20 | Paper |
ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS"
International Journal of Computational Geometry & Applications | 1993-04-01 | Paper |
Fast linear expected-time algorithms for computing maxima and convex hulls
Algorithmica | 1993-04-01 | Paper |
RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS
International Journal of Computational Geometry & Applications | 1993-01-16 | Paper |
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry | 1990-01-01 | Paper |
Applications of random sampling in computational geometry. II
Discrete & Computational Geometry | 1989-01-01 | Paper |
A fast Las Vegas algorithm for triangulating a simple polygon
Discrete & Computational Geometry | 1989-01-01 | Paper |
An algorithm for geometric minimum spanning trees requiring nearly linear expected time
Algorithmica | 1989-01-01 | Paper |
A Randomized Algorithm for Closest-Point Queries
SIAM Journal on Computing | 1988-01-01 | Paper |
New applications of random sampling in computational geometry
Discrete & Computational Geometry | 1987-01-01 | Paper |
Solving related two- and three-dimensional linear programming problems in logarithmic time
Theoretical Computer Science | 1987-01-01 | Paper |
