{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:23:54Z","timestamp":1774628634305,"version":"3.50.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1979,1]]},"DOI":"10.1016\/0020-0190(79)90085-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"20-23","source":"Crossref","is-referenced-by-count":21,"title":["A note on Rabin's nearest-neighbor algorithm"],"prefix":"10.1016","volume":"8","author":[{"given":"Steve","family":"Fortune","sequence":"first","affiliation":[]},{"given":"John","family":"Hopcroft","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(79)90085-1_BIB1","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/800105.803393","article-title":"Fast probabilistic algorithms for Hamiltonian circuits and matchings","author":"Angluin","year":"1977","journal-title":"Proc. of the Ninth Annual ACM Symposium on the Theory of Computing"},{"key":"10.1016\/0020-0190(79)90085-1_BIB2","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1145\/800113.803652","article-title":"Divide-and-conquer in multidimensional space","author":"Bentley","year":"1976","journal-title":"Proc. of the Eighth Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0020-0190(79)90085-1_BIB3","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1145\/800105.803400","article-title":"Universal classes of hash functions","author":"Carter","year":"1977","journal-title":"Proc. of the Ninth Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0020-0190(79)90085-1_BIB4","series-title":"Algorithms and Complexity","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/0020-0190(79)90085-1_BIB5","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/800116.803772","article-title":"Geometric Complexity","author":"Shamos","year":"1975","journal-title":"Proc. of the Seventh Annual ACM Symposium on Theory of Computing"},{"issue":"1","key":"10.1016\/0020-0190(79)90085-1_BIB6","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1137\/0206006","article-title":"Fast Monte-Carlo test for primality","volume":"6","author":"Solovay","year":"1977","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0020-0190(79)90085-1_BIB7","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/0020-0190(76)90064-8","article-title":"Finding nearest neighbours","volume":"5","author":"Yuval","year":"1976","journal-title":"Information Processing Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900851?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019079900851?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T14:33:17Z","timestamp":1580913197000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019079900851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,1]]}},"alternative-id":["0020019079900851"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(79)90085-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1979,1]]}}}