Show simple item record

dc.contributor.authorFortune, Stevenen_US
dc.contributor.authorHopcroft, John E.en_US
dc.date.accessioned2007-04-23T18:21:32Z
dc.date.available2007-04-23T18:21:32Z
dc.date.issued1978-04en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-340en_US
dc.identifier.urihttps://hdl.handle.net/1813/7460
dc.description.abstractRabin 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.en_US
dc.format.extent357437 bytes
dc.format.extent144787 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleA Note on Rabin's Nearest-Neighbor Algorithmen_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics