{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T11:15:46Z","timestamp":1672485346886},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"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":[[1985,3]]},"DOI":"10.1016\/0196-6774(85)90024-0","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"138-144","source":"Crossref","is-referenced-by-count":2,"title":["Two levels are as good as any"],"prefix":"10.1016","volume":"6","author":[{"given":"Markku","family":"Tamminen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(85)90024-0_BIB1","author":"Knuth","year":"1973"},{"issue":"No. 1","key":"10.1016\/0196-6774(85)90024-0_BIB2","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."},{"key":"10.1016\/0196-6774(85)90024-0_BIB3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0196-6774(82)90003-7","article-title":"On the average-case complexity of \u201cbucketing\u201d algorithms","volume":"3","author":"Akl","year":"1982","journal-title":"J. Algorithms"},{"issue":"Nos. 4\u20135","key":"10.1016\/0196-6774(85)90024-0_BIB4","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0020-0190(80)90143-X","article-title":"The design and anlysis of a new hybrid sorting algorithm","volume":"10","author":"Meijer","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90024-0_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"},{"key":"10.1016\/0196-6774(85)90024-0_BIB6","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01944472","article-title":"Usort: an efficient hybrid of distributive partitioning sorting","volume":"22","author":"Allison","year":"1982","journal-title":"BIT"},{"key":"10.1016\/0196-6774(85)90024-0_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(81)90002-X","article-title":"Searching and sorting real numbers","volume":"2","author":"Ehrlich","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(85)90024-0_BIB8","series-title":"Technical Report","article-title":"The Asymptotic Behaviour of a Distributive Sorting Method","author":"van Dam","year":"1982"},{"issue":"No. 1","key":"10.1016\/0196-6774(85)90024-0_BIB9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(83)90064-9","article-title":"Analysis of N-trees","volume":"16","author":"Tamminen","year":"1983","journal-title":"Inform. Process. Lett."},{"issue":"No. 4","key":"10.1016\/0196-6774(85)90024-0_BIB10","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0020-0190(79)90014-0","article-title":"The practical significance of D. P. sort revisited","volume":"8","author":"Dobosiewicz","year":"1979","journal-title":"Inform. Process. Lett."},{"issue":"No. 2","key":"10.1016\/0196-6774(85)90024-0_BIB11","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0020-0190(79)90139-X","article-title":"Complexity of sorting by distributive partitioning","volume":"9","author":"Jackowski","year":"1979","journal-title":"Inform. Process. Lett."},{"issue":"No. 4","key":"10.1016\/0196-6774(85)90024-0_BIB12","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(79)90013-9","article-title":"The practical significance of distributive partitioning sort","volume":"8","author":"Huits","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(85)90024-0_BIB13","series-title":"Proc. 6th Internat. Conf. on Very Large Data Bases","article-title":"Linear hashing: A new tool for file and table addressing","author":"Litwin","year":"1980"},{"issue":"No. 4","key":"10.1016\/0196-6774(85)90024-0_BIB14","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/BF01932839","article-title":"Extendible hashing and bucket tries","volume":"21","author":"Tamminen","year":"1981","journal-title":"BIT"},{"key":"10.1016\/0196-6774(85)90024-0_BIB15","series-title":"Proc. 13th ACM Sympos. on Theory of Computing","first-page":"90","article-title":"A linear probing sort and its analysis","author":"Gonnet","year":"1981"},{"key":"10.1016\/0196-6774(85)90024-0_BIB16","series-title":"Mathematical Analysis","author":"Apostol","year":"1963"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900240?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677485900240?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:26:33Z","timestamp":1548725193000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677485900240"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1985,3]]}},"alternative-id":["0196677485900240"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(85)90024-0","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}