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
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
A randomized algorithm for closest-point queries
SIAM Journal on Computing
Visibility and intersection problems in plane geometry
Discrete & Computational Geometry
Lines in space-combinators, algorithms and applications
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Determining the separation of preprocessed polyhedra: a unified approach
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
On levels in arrangements and Voronoi diagrams
Discrete & Computational Geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Efficient ray shooting and hidden surface removal
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Points and triangles in the plane and halving planes in space
Discrete & Computational Geometry
Reporting points in halfspaces
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Randomized multidimensional search trees: further results in dynamic sampling (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Ray shooting and other applications of spanning trees with low stabbing number
SIAM Journal on Computing
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Range searching with efficient hierarchical cuttings
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Ray Shooting and Parametric Search
Ray Shooting and Parametric Search
Dynamic Half-Space Range Reporting and Its Application
Dynamic Half-Space Range Reporting and Its Application
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Incidence and nearest-neighbor problems for lines in 3-space
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Ray shooting in convex polytopes
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Generalized hidden surface removal
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
On lines missing polyhedral sets in 3-space
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
Determining the castability of simple polyhedra
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient piecewise-linear function approximation using the uniform metric: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient collision detection for moving polyhedra
Proceedings of the eleventh annual symposium on Computational geometry
Two algorithms for nearest-neighbor search in high dimensions
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Locality-preserving hashing in multidimensional spaces
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Efficient search for approximate nearest neighbor in high dimensional spaces
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Lower bounds for high dimensional nearest neighbor search and related problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Iterated nearest neighbors and finding minimal polytypes
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Ray shooting amidst convex polytopes in three dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Tighter bounds for nearest neighbor search and related problems in the cell probe model
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Energy Optimal Routing in Radio Networks Using Geometric Data Structures
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Casting with Skewed Ejection Direction
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Tighter lower bounds for nearest neighbor search and related problems in the cell probe model
Journal of Computer and System Sciences - Special issue on STOC 2000
A strong lower bound for approximate nearest neighbor searching
Information Processing Letters
Mobile services discovery and selection in the publish/subscribe paradigm
CASCON '04 Proceedings of the 2004 conference of the Centre for Advanced Studies on Collaborative research
Entropy based nearest neighbor search in high dimensions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
| Hi-index | 0.00 |