Applications of Random Sampling in Computational Geometry, II (1995)

Cached

Download Links

by Kenneth L. Clarkson , Peter W. Shor
Venue:Discrete Comput. Geom
Citations:403 - 12 self

Documents Related by Co-Citation

11502 Computers and Intractability, A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
711 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
1857 Computational Geometry: An Introduction – F Preparata, M Shamos - 1985
621 Voronoi diagrams -- a survey of a fundamental geometric data structure – Franz Aurenhammer - 1991
687 Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm – Nick Littlestone - 1988
9061 Introduction to Algorithms – Matteo Frigo, Volker Strumpen - 2009
687 A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING – N. Karmarkar - 1984
818 An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions – Sunil Arya, David M. Mount, Nathan S. Netanyahu, Ruth Silverman, Angela Y. Wu - 1994
1923 Randomized Algorithms – Rajeev Motwani - 1995