The information theory bound is tight for selection in a heap
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Optimal algorithms for tree partitioning
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Applications of parametric searching in geometric optimization
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Finding the repeated median regression line
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Diameter, width, closest line pair, and parametric searching
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
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
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
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Approximate Geometric Pattern Matching Under Rigid Motions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient algorithms for maximum regression depth
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Efficient randomized algorithms for the repeated median line estimator
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The 2-center problem with obstacles
Proceedings of the sixteenth annual symposium on Computational geometry
An optimal algorithm for hyperplane depth in the plane
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Notes on computing peaks in k-levels and parametric spanning trees
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Space-time trade-offs for some ranking and searching queries
Information Processing Letters
Parametric search made practical
Proceedings of the eighteenth annual symposium on Computational geometry
The 2-center problem with obstacles
Journal of Algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel Optimal Weighted Links
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Decomposable multi-parameter matroid optimization problems
Theoretical Computer Science - Latin American theoretical informatics
Counting and representing intersections among triangles in three dimensions
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Parametric search made practical
Computational Geometry: Theory and Applications - Special issue on the 18th annual symposium on computational geometrySoCG2002
Proximity problems on line segments spanned by points
Computational Geometry: Theory and Applications
A practical approximation algorithm for the LMS line estimator
Computational Statistics & Data Analysis
On the performance of the ICP algorithm
Computational Geometry: Theory and Applications
Parallel Optimal Weighted Links
Transactions on Computational Science III
Proximity problems on line segments spanned by points
Computational Geometry: Theory and Applications
Counting and representing intersections among triangles in three dimensions
Computational Geometry: Theory and Applications
Repeated median and hybrid filters
Computational Statistics & Data Analysis
Optimal Randomized Algorithm for the Density Selection Problem
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Efficient algorithms for the sum selection problem and k maximum sums problem
Theoretical Computer Science
Counting inversions, offline orthogonal range counting, and related problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Some variations on constrained minimum enclosing circle problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
A center transversal theorem for hyperplanes and applications to graph drawing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Ray-shooting depth: computing statistical data depth of point sets in the plane
ESA'11 Proceedings of the 19th European conference on Algorithms
In-place randomized slope selection
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Equipartitions of measures by 2-fans
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient algorithms for the sum selection problem and k maximum sums problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Voting method for stable range optical flow computation
PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology
On computing the centroid of the vertices of an arrangement and related problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Some variations on constrained minimum enclosing circle problem
Journal of Combinatorial Optimization
A note on searching line arrangements and applications
Information Processing Letters
Hi-index | 0.00 |