Slowing down sorting networks to obtain faster sorting algorithms
Journal of the ACM (JACM)
Introduction to algorithms
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
Finding k points with minimum diameter and related problems
Journal of Algorithms
Randomized optimal algorithm for slope selection
Information Processing Letters
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Discrete & Computational Geometry - Special issue on ACM symposium on computational geometry, North Conway
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Ray shooting and parametric search
SIAM Journal on Computing
Computing the smallest k-enclosing circle and related problems
Computational Geometry: Theory and Applications
k-Violation linear programming
Information Processing Letters
On enclosing k points by a circle
Information Processing Letters
Static and dynamic algorithms for k-point clustering problems
Journal of Algorithms
A deterministic algorithm for the three-dimensional diameter problem
Computational Geometry: Theory and Applications
Rectilinear and polygonal p-piercing and p-center problems
Proceedings of the twelfth annual symposium on Computational geometry
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Geometric pattern matching under Euclidean motion
Computational Geometry: Theory and Applications - Special issue: computational geometry, theory and applications
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
An Expander-Based Approach to Geometric Optimization
SIAM Journal on Computing
Constructing cuttings in theory and practice
Proceedings of the fourteenth annual symposium on Computational geometry
Approximate nearest neighbor queries in fixed dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Faster construction of planar two-centers
SODA '97 Proceedings of the eighth 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)
Improvements on Geometric Pattern Matching Problems
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
On Some Geometric Selection and Optimization Problems via Sorted Matrices
WADS '95 Proceedings of the 4th International Workshop on Algorithms and Data Structures
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Geometric Pattern Matching in d-Dimensional Space
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
On Piercing Sets of Axis-Parallel Rectangles and Rings
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Efficient Randomized Algorithms for Some Geometric Optimization
Efficient Randomized Algorithms for Some Geometric Optimization
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Approximation and exact algorithms for minimum-width annuli and shells
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
An optimal randomized algorithm for d-variate zonoid depth
Computational Geometry: Theory and Applications
Optimal location of transportation devices
Computational Geometry: Theory and Applications
Counting inversions, offline orthogonal range counting, and related problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Hi-index | 0.00 |