{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T15:26:08Z","timestamp":1648913168447},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,3]]},"DOI":"10.1016\/0196-6774(82)90003-7","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"9-13","source":"Crossref","is-referenced-by-count":9,"title":["On the average-case complexity of \u201cbucketing\u201d algorithms"],"prefix":"10.1016","volume":"3","author":[{"given":"Selim G","family":"Akl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henk","family":"Meijer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 1","key":"10.1016\/0196-6774(82)90003-7_BIB1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(80)90023-X","article-title":"Selection by distributive partitioning","volume":"11","author":"Allison","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(82)90003-7_BIB2","unstructured":"J. L. Bentley, M. G. Faust, and F. P. Preparata, \u201cApproximation Algorithms for Convex Hulls,\u201d Technical Report CMU-CS-80-109, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA."},{"issue":"No. 4","key":"10.1016\/0196-6774(82)90003-7_BIB3","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","article-title":"Optimal expected-time algorithms for closest-point problems","volume":"6","author":"Bentley","year":"1980","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0196-6774(82)90003-7_BIB4","unstructured":"K. Q. Brown, \u201cGeometric Transforms for Fast Geometric Algorithms,\u201d Technical Report CMU-CS-80-101, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA."},{"issue":"No. 1","key":"10.1016\/0196-6774(82)90003-7_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02243418","article-title":"Average time behaviour of distributive sorting algorithms","volume":"26","author":"Devroye","year":"1981","journal-title":"Computing"},{"issue":"No. 1","key":"10.1016\/0196-6774(82)90003-7_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(78)90028-5","article-title":"Sorting by distributive partitioning","volume":"7","author":"Dobosiewicz","year":"1978","journal-title":"Inform. Process. Lett."},{"issue":"No. 1","key":"10.1016\/0196-6774(82)90003-7_BIB7","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/0020-0190(79)90085-1","article-title":"A note on Rabin's nearest-neighbor algorithm","volume":"8","author":"Fortune","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(82)90003-7_BIB8","series-title":"Algorithms on Sets and Related Problems","author":"Gonzalez","year":"1975"},{"key":"10.1016\/0196-6774(82)90003-7_BIB9","series-title":"Statistics of Extremes","author":"Gumbel","year":"1958"},{"issue":"No. 4","key":"10.1016\/0196-6774(82)90003-7_BIB10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(80)90143-X","article-title":"The design and analysis of a new hybrid sorting algorithm","volume":"10","author":"Meijer","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(82)90003-7_BIB11","series-title":"Algorithms and Complexity","first-page":"21","article-title":"Probabilistic algorithms","author":"Rabin","year":"1976"},{"key":"10.1016\/0196-6774(82)90003-7_BIB12","series-title":"Real and Complex Analysis","author":"Rudin","year":"1966"},{"key":"10.1016\/0196-6774(82)90003-7_BIB13","unstructured":"G. T. Toussaint, and S. G. Akl, \u201cThe Convex Hull Problem,\u201d Plenum, New York, in press."},{"issue":"No. 3","key":"10.1016\/0196-6774(82)90003-7_BIB14","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":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(82)90003-7_BIB15","unstructured":"B. W. Weide, \u201cStatistical Methods in Algorithm Design and Analysis,\u201d Technical Report CMU-CS-78-142, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900037?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900037?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:52:02Z","timestamp":1548726722000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["0196677482900037"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90003-7","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}