{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T23:38:45Z","timestamp":1693870725352},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1991,12,1]],"date-time":"1991-12-01T00:00:00Z","timestamp":691545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1991,12]]},"DOI":"10.1007\/bf01933171","type":"journal-article","created":{"date-parts":[[2005,7,25]],"date-time":"2005-07-25T06:49:54Z","timestamp":1122274194000},"page":"558-565","source":"Crossref","is-referenced-by-count":3,"title":["Probabilistic analysis of an algorithm for solving thek-dimensional all-nearest-neighbors problem by projection"],"prefix":"10.1007","volume":"31","author":[{"given":"Frank","family":"Bartling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Hinrichs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01933171_CR1","doi-asserted-by":"crossref","first-page":"1000","DOI":"10.1109\/T-C.1975.224110","volume":"10","author":"J. H. Friedman","year":"1975","unstructured":"J. H. Friedman, F. Baskett and L. J. Shustek,An algorithm for finding nearest neighbors, IEEE Transactions on Computers C-24, 10, 1000\u20131006, October 1975.","journal-title":"IEEE Transactions on Computers C-24"},{"key":"BF01933171_CR2","unstructured":"M. Golin,Probabilistic analysis of geometric algorithms, Ph.D. thesis, Princeton University, Department of Computer Science, CS-TR-266-90, June 1990."},{"key":"BF01933171_CR3","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0020-0190(88)90150-0","volume":"26","author":"K. Hinrichs","year":"1988","unstructured":"K. Hinrichs, J. Nievergelt and P. Schorn,Plane-sweep solves the closest pair problem elegantly, Information Processing Letters 26 (1988), 255\u2013261.","journal-title":"Information Processing Letters"},{"key":"BF01933171_CR4","unstructured":"K. Hinrichs, J. Nievergelt and P. Schorn,An allround sweep algorithm for 2-dimensional nearest-neighbor problems, Proc. of the Second Canadian Conference in Computational Geometry, University of Ottawa (1990), 343\u2013346."},{"key":"BF01933171_CR5","unstructured":"E. Kaufmann and R.-D. Reiss,On conditional distributions of nearest neighbors, Mathematischer Forschungsbericht 244\/1990, Universit\u00e4t-GH-Siegen."},{"key":"BF01933171_CR6","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou and J. L. Bentley,A worst-case analysis of nearest neighbor searching by projection, 7th Int. Conf. on Automata, Languages and Programming (1980), 470\u2013482.","DOI":"10.1007\/3-540-10003-2_92"},{"key":"BF01933171_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9620-8","volume-title":"Approximate Distributions of Order Statistics","author":"R.-D. Reiss","year":"1989","unstructured":"R.-D. Reiss,Approximate Distributions of Order Statistics, Springer-Verlag, New York, 1989."},{"key":"BF01933171_CR8","first-page":"24","volume-title":"Accurate and efficient algorithms for proximity problems","author":"P. Schorn","year":"1990","unstructured":"P. Schorn,Accurate and efficient algorithms for proximity problems, Proc. of the Second Canadian Conference in Computational Geometry, University of Ottawa, Canada (1990), 24\u201327."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01933171.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01933171\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01933171","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T20:59:46Z","timestamp":1557435586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01933171"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["BF01933171"],"URL":"https:\/\/doi.org\/10.1007\/bf01933171","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}