A note on Rabin's nearest-neighbor algorithm
From MaRDI portal
Publication:1257342
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
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