{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T19:37:40Z","timestamp":1782934660732,"version":"3.54.5"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1989,3,1]],"date-time":"1989-03-01T00:00:00Z","timestamp":604713600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1989,3]]},"DOI":"10.1007\/bf02187718","type":"journal-article","created":{"date-parts":[[2005,9,20]],"date-time":"2005-09-20T18:57:34Z","timestamp":1127242654000},"page":"101-115","source":"Crossref","is-referenced-by-count":168,"title":["AnO(n logn) algorithm for the all-nearest-neighbors Problem"],"prefix":"10.1007","volume":"4","author":[{"given":"Pravin M.","family":"Vaidya","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[1989,3,1]]},"reference":[{"key":"BF02187718_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, Lower bounds for algebraic computation trees,Proc. 15th Annual ACM Symp. Theory Comput., 1983, pp. 80\u201386.","DOI":"10.1145\/800061.808735"},{"key":"BF02187718_CR2","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/358841.358850","volume":"23","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley, Multidimensional divide-and-conquer,Comm. ACM23 (1980), 214\u2013229.","journal-title":"Comm. ACM"},{"key":"BF02187718_CR3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(77)90070-9","volume":"6","author":"J. L. Bentley","year":"1977","unstructured":"J. L. Bentley, D. F. Stanat, and E. H. Williams, Jr., The complexity of finding fixed radius nearest neighbors,Inform. Process. Lett. 6 (1977), 209\u2013212.","journal-title":"Inform. Process. Lett."},{"key":"BF02187718_CR4","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"J. L. Bentley","year":"1982","unstructured":"J. L. Bentley, B. Weide, and A. Y. Yao, Optimal expected-time algorithms for closest-point problems,ACM Tran. Math. Software 6 (1982), 563\u2013579.","journal-title":"ACM Tran. Math. Software"},{"key":"BF02187718_CR5","doi-asserted-by":"crossref","unstructured":"K. Clarkson, Fast algorithms for the all-nearest-neighbors problem,Proc. 24th Annual Symp. Found. Comput. Sci., 1983, pp. 226\u2013232.","DOI":"10.1109\/SFCS.1983.16"},{"key":"BF02187718_CR6","doi-asserted-by":"crossref","unstructured":"H. N. Gabow, J. L. Bentley, and R. E. Tarjan, Scaling and related techniques for geometry problems,Proc. 16th Annual ACM Symp. Theory Comput., 1984, pp. 135\u2013143.","DOI":"10.1145\/800057.808675"},{"key":"BF02187718_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos,Computational Geometry: An Introduction, Springer-Verlag, New York, 1985."},{"key":"BF02187718_CR8","volume-title":"Combinatorial Algorithms: Theory and Practice","author":"E. M. Reingold","year":"1977","unstructured":"E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms: Theory and Practice, Prentice Hall, Englewood Cliffs, NJ, 1977."},{"key":"BF02187718_CR9","volume-title":"Computational Geometry","author":"M. I. Shamos","year":"1978","unstructured":"M. I. Shamos, Computational Geometry, Ph.D. dissertation, Yale University, New Haven, CT, 1978."},{"key":"BF02187718_CR10","first-page":"21","volume-title":"Algorithms and Complexity","author":"M. O. Rabin","year":"1976","unstructured":"M. O. Rabin, Probabilistic algorithms, inAlgorithms and Complexity (J. F. Traub, ed.), Academic Press, New York, 1976, pp. 21\u201330."},{"key":"BF02187718_CR11","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0020-0190(75)90044-7","volume":"3","author":"F. Yuval","year":"1975","unstructured":"F. Yuval, Finding nearest neighbors,Inform. Process. Lett. 3 (1975), 113\u2013114.","journal-title":"Inform. Process. Lett."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187718.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187718\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187718","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T17:22:33Z","timestamp":1557854553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187718"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,3]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,3]]}},"alternative-id":["BF02187718"],"URL":"https:\/\/doi.org\/10.1007\/bf02187718","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,3]]}}}