Approximation and exact algorithms for minimum-width annuli and shells
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Efficiently approximating the minimum-volume bounding box of a point set in three dimensions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
Better algorithms for high-dimensional proximity problems via asymmetric embeddings
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximate minimum enclosing balls in high dimensions using core-sets
Journal of Experimental Algorithmics (JEA)
Fast GPU-based locality sensitive hashing for k-nearest neighbor computation
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
| Hi-index | 0.89 |