A note on Rabin's nearest-neighbor algorithm

DOI10.1016/0020-0190(79)90085-1zbMath0405.68056OpenAlexW2569696182MaRDI QIDQ1257342

Steven Fortune, John E. Hopcrofts

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

HashingProbabilistic AlgorithmsNearest Neighbor

Mathematics Subject Classification ID

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

Related Items

Efficient randomized incremental algorithm for the closest pair problem using Leafary trees, The average performance analysis of a closest‐pair algorithm, ON ENUMERATING AND SELECTING DISTANCES, Dominance Product and High-Dimensional Closest Pair under L_infty

Cites Work

• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Finding nearest neighbours
• A Fast Monte-Carlo Test for Primality
• Unnamed Item
• Unnamed Item
• Unnamed Item