Skip lists: a probabilistic alternative to balanced trees
Communications of the ACM
Determining the separation of preprocessed polyhedra: a unified approach
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Small-dimensional linear programming and convex hulls made easy
Discrete & Computational Geometry
Randomized optimal algorithm for slope selection
Information Processing Letters
Journal of Algorithms
Intersection queries in curved objects
Journal of Algorithms
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Ray shooting and parametric search
SIAM Journal on Computing
Computing the smallest k-enclosing circle and related problems
Computational Geometry: Theory and Applications
ACM Computing Surveys (CSUR)
Las Vegas algorithms for linear and integer programming when the dimension is small
Journal of the ACM (JACM)
On enclosing k points by a circle
Information Processing Letters
Output-sensitive results on convex hulls, extreme points, and related problems
Proceedings of the eleventh annual symposium on Computational geometry
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Efficient collision detection for moving polyhedra
Proceedings of the eleventh annual symposium on Computational geometry
Efficient randomized algorithms for some geometric optimization problems
Proceedings of the eleventh annual symposium on Computational geometry
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Space-time tradeoffs for emptiness queries (extended abstract)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
On range reporting, ray shooting and k-level construction
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Deterministic algorithms for 2-d convex programming and 3-d online linear programming
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The onion technique: indexing for linear optimization queries
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Linear programming queries revisited
Proceedings of the sixteenth annual symposium on Computational geometry
Approximating the diameter, width, smallest enclosing cylinder, and minimum-width annulus
Proceedings of the sixteenth annual symposium on Computational geometry
An optimal randomized algorithm for maximum Tukey depth
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
On approximate range counting and depth
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing
Polytope approximation and the Mahler volume
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Enumerating a subset of the integer points inside a Minkowski sum
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |