A note on Rabin's nearest-neighbor algorithm

DOI10.1016/0020-0190(79)90085-1MaRDI QIDQ1257342zbMATH OpenOpenAlexFDO

Authors Steven Fortune, John Hopcroft

Publication date 1979

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://hdl.handle.net/1813/7460

zbMATH Keywords

HashingNearest NeighborProbabilistic Algorithms

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Cites work

• A Fast Monte-Carlo Test for Primality
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Finding nearest neighbours
• scientific article; zbMATH DE number 3557226 (Why is no real title available?)
• scientific article; zbMATH DE number 3569833 (Why is no real title available?)
• scientific article; zbMATH DE number 3597592 (Why is no real title available?)

Cited in

(7)

• The average performance analysis of a closest‐pair algorithm
• ON ENUMERATING AND SELECTING DISTANCES
• Dominance product and high-dimensional closest pair under \(L_\infty\)
• Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
• Approximate search for the kth order distance in a system of unit square points
• A parallel batch-dynamic data structure for the closest pair problem
• Rabin's Closest Pair of Points Algorithm

This page was built for publication: A note on Rabin's nearest-neighbor algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1257342)