Kenneth L. Clarkson  Home/Search
Context Related
| belllabs.com/cm/cs/doc/9...2rga.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: belllabs.com/who/clarkson/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Voronoi diagrams and their applications. In Computa- tional Geometry and its Applications (CG '89), pages 148 157. LNCS 344, 1988. (Update)
Similar documents based on text: More All
0.4: Unknown - Hs Ik Lf (Correct)
0.3: New Algorithmic Results for Lines-in-3-Space Problems - Guibas, Pellegrini (1992) (Correct)
0.3: A Simple and Fast Incremental Randomized Algorithm for Computing.. - Seidel (1991) (Correct)
Related documents from co-citation: More All
20: Applications of random sampling in computational geometry - Clarkson, Shor - 1989
15: Computational Geometry: An Introduction Through Randomized Algorithms (context) - Mulmuley - 1993
12: Backwards analysis of randomized geometric algorithms - Seidel - 1993
BibTeX entry: (Update)
K.L. Clarkson. Randomized geometric algorithms. In D.-Z. Du and F.K.Hwang, eds., Computing in Euclidean Geometry, Vol.1 of Lecture Notes Series on Computing, pages 117--162. World Scientific, Singapore, 1992. http://citeseer.ist.psu.edu/clarkson92randomized.html More
@article{ clarkson92randomized,
author = "K. L. Clarkson",
title = "Randomized Geometric Algorithms",
journal = "Computers and Euclidean Geometry",
editor = "F. K. Hwang and D. Z. Hu (eds) and World Scientific Publishing",
year = "1992",
url = "citeseer.ist.psu.edu/clarkson92randomized.html" }
Citations (may not include all citations):465 Learnability and the Vapnik-Chervonenkis dimension (context) - Blumer, Ehrenfeucht et al. - 1989
53 Applications of random sampling to on-line algorithms in com.. - Boissonnat, Devillers et al.
47 Compact distributed data structures for adaptive routing - Awerbuch, Bar-Noy et al. - 1989
38 Euclidean minimum spanning trees and bichromatic closest pai.. (context) - Agarwal, Edelsbrunner et al. - 1991
25 Intersection and Decomposition Algorithms for' Planar' Arran.. (context) - Agarwal - 1991
20 Parallel linear programming in fixed dimension almost surely.. - Alon, Megiddo - 1990
16 A probabilistic algorithm for computing Hough transforms (context) - Bergen, Shvaytser - 1991
16 The number of small semispaces of a finite set of points in .. (context) - Alon, Gy - 1986
12 A randomization scheme for speeding up algorithms for linear.. (context) - Adler, Shamir - 1990
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC