The power of geometric duality
BIT - Ellis Horwood series in artificial intelligence
Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Halfspace range search: an algorithmic application of k-sets
Discrete & Computational Geometry
An O(n log n) algorithm for the all-nearest-neighbors problem
Discrete & Computational Geometry
Randomized optimal algorithm for slope selection
Information Processing Letters
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
A simple algorithm for enumerating longest distances in the plane
Information Processing Letters
ACM Computing Surveys (CSUR)
A simple randomized sieve algorithm for the closest-pair problem
Information and Computation
Randomized algorithms
Algorithms for proximity problems in higher dimensions
Computational Geometry: Theory and Applications
A reliable randomized algorithm for the closest-pair problem
Journal of Algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Simple randomized algorithms for closest pair problems
Nordic Journal of Computing
Divide-and-conquer in multidimensional space
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Approximation Algorithms for the Bottleneck Stretch Factor Problem
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Exact Point Pattern Matching and the Number of Congruent Triangles in a Three-Dimensional Pointset
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
| Hi-index | 0.00 |