|
96
|
A deterministic view of random sampling and its use in geometry
– Bernard Chazelle, Joel Friedman
- 1990
|
|
357
|
Applications of Random Sampling in Computational Geometry, II
– Kenneth L. Clarkson, Peter W. Shor
- 1995
|
|
1478
|
The probabilistic method
– Joel Spencer
- 1992
|
|
275
|
Computational Geometry: An Introduction Through Randomized Algorithms
– K Mulmuley
- 1993
|
|
44
|
Product Range Spaces, Sensitive Sampling, and Derandomization
– Hervé Brönnimann, et al.
- 1993
|
|
240
|
Epsilon-Nets and Simplex Range Queries
– David Haussler, Emo Welzl
- 1986
|
|
27
|
Geometric partitioning made easier, even in parallel.In Proc. 9th Annu
– M T Goodrich
- 1993
|
|
42
|
Parallel Algorithms for Higher-Dimensional Convex Hulls
– Nancy M. Amato, et al.
|
|
1611
|
Computational geometry: An introduction
– F P Preparata, M I Shamos
- 1985
|
|
134
|
Applications of random sampling
– K L Clarkson, P W Shor
- 1989
|
|
48
|
Approximations and optimal geometric divide-and-conquer
– J Matousek
- 1991
|
|
71
|
Efficient Partition Trees
– Jim Matousek
- 1992
|
|
816
|
On the uniform convergence of relative frequencies of events to their probabilities. Theory of Prob. and its
– Vladimir Vapnik, Alexey Chervonenkis
- 1971
|
|
68
|
The Discrepancy Method
– B Chazelle
- 2000
|
|
79
|
A fast planar partition algorithm
– K Mulmuley
- 1990
|
|
24
|
Randomized Parallel Algorithms For Trapezoidal Diagrams
– Kenneth L. Clarkson, Richard Cole, Robert E. Tarjan
- 1992
|
|
35
|
Decision Tree Construction via Linear Programming
– K P Bennett
- 1992
|
|
76
|
Cutting hyperplanes for divide-and-conquer
– B Chazelle
- 1993
|
|
31
|
Cutting hyperplane arrangements
– J Matousek
- 1991
|
