Derandomization in Computational Geometry (1996)

Cached

Download Links

by Jirí Matousek
Citations:17 - 1 self

Documents Related by Co-Citation

110 A deterministic view of random sampling and its use in geometry – Bernard Chazelle, Joel Friedman - 1990
396 Applications of Random Sampling in Computational Geometry, II – Kenneth L. Clarkson, Peter W. Shor - 1995
1707 The probabilistic method – N Alon, J Spencer
286 Computational Geometry: An Introduction Through Randomized Algorithms – Ketan Mulmuley - 1993
46 Product Range Spaces, Sensitive Sampling, and Derandomization – Hervé Brönnimann, et al. - 1993
266 Epsilon-Nets and Simplex Range Queries – David Haussler, Emo Welzl - 1986
28 Geometric partitioning made easier, even in parallel – M T Goodrich - 1993
44 Parallel Algorithms for Higher-Dimensional Convex Hulls – Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos
1770 Computational Geometry: An Introduction – Franco P Preparata, Michael Ian Shamos - 1985
152 Applications of random sampling – K L Clarkson, P W Shor - 1989
50 Approximations and optimal geometric divide-and-conquer – J Matousek - 1991
73 Efficient Partition Trees – Jim Matousek - 1992
946 On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications – V Vapnik, A Chervonenkis - 1971
84 The Discrepancy Method – B Chazelle - 2001
23 Randomized Parallel Algorithms For Trapezoidal Diagrams – Kenneth L. Clarkson, Richard Cole, Robert E. Tarjan - 1992
84 A fast planar partition algorithm – K Mulmuley - 1990
39 Decision tree construction via linear programming – Kristin P Bennett - 1992
84 Cutting hyperplanes for divide-and-conquer – B Chazelle - 1993
30 Cutting hyperplane arrangements – J Matousek - 1991