Derandomization in Computational Geometry (1996)

Cached

Download Links

by Jirí Matousek
Citations:17 - 1 self

Documents Related by Co-Citation

106 A deterministic view of random sampling and its use in geometry – Bernard Chazelle, Joel Friedman - 1990
386 Applications of Random Sampling in Computational Geometry, II – Kenneth L. Clarkson, Peter W. Shor - 1995
285 Computational Geometry. An Introduction Through Randomized Algorithms – Ketan Mulmuley - 1994
46 Product Range Spaces, Sensitive Sampling, and Derandomization – Hervé Brönnimann, et al. - 1993
1685 The Probabilistic Method – N Alon, J Spencer - 2000
260 Epsilon-Nets and Simplex Range Queries – David Haussler, Emo Welzl - 1986
151 Applications of random sampling – K L Clarkson, P Shor - 1989
28 Geometric partitioning made easier, even in parallel – M T Goodrich - 1993
43 Parallel Algorithms for Higher-Dimensional Convex Hulls – Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
1759 Computational geometry: an introduction – F P Preparata, M I Shamos - 1985
84 The Discrepancy Method – B Chazelle - 2000
23 Randomized Parallel Algorithms For Trapezoidal Diagrams – Kenneth L. Clarkson, Richard Cole, Robert E. Tarjan - 1992
84 A fast planar partition algorithm – K Mulmuley - 1991
83 Cutting hyperplanes for divide-and-conquer – B Chazelle - 1991
28 Cutting hyperplane arrangements – J Matousek - 1991
47 Approximations and optimal geometric divide-and-conquer – J Matousek - 1991
71 Efficient Partition Trees – Jim Matousek - 1992
940 On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications – Chervonenkis - 1971
12 Efficient data-reduction methods for on-line association rule discovery – Herve Bronnimann, Bin Chen, Manoranjan Dash, Peter Haas, Yi Qiao, Peter Scheuermann - 2004