A note on Rabin's nearest-neighbor algorithm
- 31 January 1979
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 8 (1) , 20-23
- https://doi.org/10.1016/0020-0190(79)90085-1
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- A Fast Monte-Carlo Test for PrimalitySIAM Journal on Computing, 1977
- Universal classes of hash functions (Extended Abstract)Published by Association for Computing Machinery (ACM) ,1977
- Fast probabilistic algorithms for hamiltonian circuits and matchingsPublished by Association for Computing Machinery (ACM) ,1977
- Finding nearest neighboursInformation Processing Letters, 1976
- Divide-and-conquer in multidimensional spacePublished by Association for Computing Machinery (ACM) ,1976
- Geometric complexityPublished by Association for Computing Machinery (ACM) ,1975