Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7460
Title: A Note on Rabin's Nearest-Neighbor Algorithm
Authors: Fortune, Steven
Hopcroft, John E.
Keywords: computer science
technical report
Issue Date: Apr-1978
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-340
Abstract: Rabin has proposed a probabilistic algorithm for finding the closest pair of a set of points in Euclidean space. His algorithm is asymtomatically linear whereas the best of the known deterministic algorithms take order $n \log n$ time. We show that at least part of the speed up is due to the model rather than the probabilistic nature of the algorithm.
URI: http://hdl.handle.net/1813/7460
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
78-340.pdf349.06 kBAdobe PDFView/Open
78-340.ps141.39 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us