Almost optimal set covers in finite VC-dimension: (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)
Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Space-time tradeoffs for emptiness queries (extended abstract)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approximate nearest neighbors: towards removing the curse of dimensionality
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proceedings of the fourteenth annual symposium on Computational geometry
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
On enumerating and selecting distances
Proceedings of the fourteenth annual symposium on Computational geometry
On range reporting, ray shooting and k-level construction
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Efficient generation of k-directional assembly sequences
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
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
Semi-online maintenance of geometric optima and measures
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Pseudo-line arrangements: duality, algorithms, and applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Parallel Convex Hull Computation by Generalised Regular Sampling
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Improved approximation algorithms for geometric set cover
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Kinetic sorting and kinetic convex hulls
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
Ray shooting and stone throwing with near-linear storage
Computational Geometry: Theory and Applications
Ray shooting amid balls, farthest point from a line, and range emptiness searching
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On approximating the depth and related problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Kinetic sorting and kinetic convex hulls
Computational Geometry: Theory and Applications
On approximate halfspace range counting and relative epsilon-approximations
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
On approximate range counting and depth
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
A (slightly) faster algorithm for klee's measure problem
Proceedings of the twenty-fourth annual symposium on Computational geometry
Proceedings of the twenty-fourth annual symposium on Computational geometry
Output-sensitive algorithms for Tukey depth and related problems
Statistics and Computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Optimal halfspace range reporting in three dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Dynamic ham-sandwich cuts in the plane
Computational Geometry: Theory and Applications
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Epsilon nets and union complexity
Proceedings of the twenty-fifth annual symposium on Computational geometry
Near-linear approximation algorithms for geometric hitting sets
Proceedings of the twenty-fifth annual symposium on Computational geometry
A general approach for cache-oblivious range reporting and approximate range counting
Proceedings of the twenty-fifth annual symposium on Computational geometry
On the set multi-cover problem in geometric settings
Proceedings of the twenty-fifth annual symposium on Computational geometry
A (slightly) faster algorithm for Klee's measure problem
Computational Geometry: Theory and Applications
Ray shooting and stone throwing with near-linear storage
Computational Geometry: Theory and Applications
Extremal point queries with lines and line segments and related problems
Computational Geometry: Theory and Applications
Approximate range searching: The absolute model
Computational Geometry: Theory and Applications
A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
Journal of the ACM (JACM)
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Proceedings of the twenty-sixth annual symposium on Computational geometry
Proceedings of the twenty-sixth annual symposium on Computational geometry
A general approach for cache-oblivious range reporting and approximate range counting
Computational Geometry: Theory and Applications
Approximate Halfspace Range Counting
SIAM Journal on Computing
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Approximate polytope membership queries
Proceedings of the forty-third annual ACM symposium on Theory of computing
Indexing for vector projections
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Convex hull of imprecise points in o(n log n) time after preprocessing
Proceedings of the twenty-seventh annual symposium on Computational geometry
Tight lower bounds for the size of epsilon-nets
Proceedings of the twenty-seventh annual symposium on Computational geometry
SIAM Journal on Computing
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing
Polytope approximation and the Mahler volume
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Ordered and unordered top-K range reporting in large data sets
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Range selection and median: tight cell probe lower bounds and adaptive data structures
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improved space bounds for cache-oblivious range reporting
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Processing a large number of continuous preference top-k queries
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Higher-dimensional orthogonal range reporting and rectangle stabbing in the pointer machine model
Proceedings of the twenty-eighth annual symposium on Computational geometry
On the set multicover problem in geometric settings
ACM Transactions on Algorithms (TALG)
approximate range searching: the absolute model
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Convex hull of points lying on lines in o(nlogn) time after preprocessing
Computational Geometry: Theory and Applications
Small-size relative (p,ε)-approximations for well-behaved range spaces
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |