Information and Control
Epsilon-nets and simplex range queries
SCG '86 Proceedings of the second annual symposium on Computational geometry
Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A general approach to d-dimensional geometric queries
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
A probabilistic algorithm for the post office problem
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Halfspace range search: an algorithmic application of K-sets
SCG '85 Proceedings of the first annual symposium on Computational geometry
An improved algorithm for constructing kth-order Voronoi diagrams
SCG '85 Proceedings of the first annual symposium on Computational geometry
On k-hulls and related problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Computational geometry.
Scalable Uniform Graph Sampling by Local Computation
SIAM Journal on Scientific Computing
| Hi-index | 0.00 |