| Publication | Date of Publication | Type |
|---|
Optimal volume-sensitive bounds for polytope approximation
| 2024-10-16 | Paper |
Economical convex coverings and applications
SIAM Journal on Computing | 2024-08-06 | Paper |
Economical convex coverings and applications
| 2024-05-14 | Paper |
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Approximate convex intersection detection with applications to width and Minkowski sums
| 2021-08-04 | Paper |
Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Polytope approximation and the Mahler volume
| 2019-05-10 | Paper |
Near-optimal \(\varepsilon\)-kernel construction and related problems
| 2018-08-13 | Paper |
A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Optimal approximate polytope membership
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
scientific article; zbMATH DE number 6876122 (Why is no real title available?)
| 2018-05-29 | Paper |
Better \(\varepsilon\)-dependencies for offline approximate nearest neighbor search, Euclidean minimum spanning trees, and \(\varepsilon\)-kernels
Proceedings of the thirtieth annual symposium on Computational geometry | 2018-04-23 | Paper |
On the combinatorial complexity of approximating polytopes
| 2018-01-30 | Paper |
Approximate polytope membership queries
SIAM Journal on Computing | 2018-01-12 | Paper |
On the combinatorial complexity of approximating polytopes
Discrete \& Computational Geometry | 2018-01-11 | Paper |
Approximate geometric MST range queries
| 2017-10-10 | Paper |
A 2.5-factor approximation algorithm for the \(k\)-MST problem
Information Processing Letters | 2016-06-09 | Paper |
A simple entropy-based algorithm for planar point location
ACM Transactions on Algorithms | 2015-09-02 | Paper |
On the importance of idempotence
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Space-time tradeoffs for approximate spherical range counting
| 2014-10-13 | Paper |
Optimal area-sensitive bounds for polytope approximation
Proceedings of the twenty-eighth annual symposium on Computational geometry | 2014-08-07 | Paper |
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
Tight lower bounds for halfspace range searching
Proceedings of the twenty-sixth annual symposium on Computational geometry | 2014-04-03 | Paper |
Tight lower bounds for halfspace range searching
Discrete \& Computational Geometry | 2012-05-22 | Paper |
A unified approach to approximate proximity searching
Algorithms – ESA 2010 | 2010-09-06 | Paper |
Space-efficient approximate Voronoi diagrams
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Space-time tradeoffs for approximate nearest neighbor searching
Journal of the ACM | 2010-07-14 | Paper |
The effect of corners on the complexity of approximate range searching
Discrete \& Computational Geometry | 2009-04-27 | Paper |
scientific article; zbMATH DE number 5506186 (Why is no real title available?)
| 2009-02-10 | Paper |
Space-Time Tradeoffs for Proximity Searching in Doubling Spaces
Algorithms - ESA 2008 | 2008-11-25 | Paper |
Optimal Expected-Case Planar Point Location
SIAM Journal on Computing | 2008-04-22 | Paper |
APPROXIMATION ALGORITHM FOR MULTIPLE-TOOL MILLING
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM | 2005-01-25 | Paper |
scientific article; zbMATH DE number 2119656 (Why is no real title available?)
| 2004-11-29 | Paper |
Expected-Case Complexity of Approximate Nearest Neighbor Searching
SIAM Journal on Computing | 2003-06-19 | Paper |
Binary space partitions for axis-parallel line segments: Size-height tradeoffs.
Information Processing Letters | 2003-01-21 | Paper |
A simple entropy-based algorithm for planar point location
| 2002-06-18 | Paper |
Entropy-preserving cuttings and space-efficient planar point location
| 2002-01-30 | Paper |
scientific article; zbMATH DE number 1670858 (Why is no real title available?)
| 2001-11-11 | Paper |
Approximate range searching
Computational Geometry | 2001-09-13 | Paper |
scientific article; zbMATH DE number 1263225 (Why is no real title available?)
| 2001-08-28 | Paper |
scientific article; zbMATH DE number 1617272 (Why is no real title available?)
| 2001-07-11 | Paper |
scientific article; zbMATH DE number 1445326 (Why is no real title available?)
| 2000-05-10 | Paper |
On the Expected Depth of Random Circuits
Combinatorics, Probability and Computing | 2000-03-07 | Paper |
Dynamic algorithms for geometric spanners of small diameter: Randomized solutions
Computational Geometry | 2000-03-07 | Paper |
Efficient construction of a bounded-degree spanner with low weight
Algorithmica | 1997-06-09 | Paper |
scientific article; zbMATH DE number 1003290 (Why is no real title available?)
| 1997-04-23 | Paper |
scientific article; zbMATH DE number 437552 (Why is no real title available?)
| 1993-12-21 | Paper |
