{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T11:22:53Z","timestamp":1720437773201},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10059,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1986]]},"DOI":"10.1016\/0167-6423(86)90003-1","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T11:44:35Z","timestamp":1048592675000},"page":"23-33","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Analysing a class of distributive partitioning sort algorithms"],"prefix":"10.1016","volume":"7","author":[{"given":"M.","family":"van der Nat","sequence":"first","affiliation":[]},{"given":"A.A.","family":"Verrijn-Stuart","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(86)90003-1_BIB1","first-page":"325","article-title":"Recent advances in hybrid sorting algorithms","volume":"21","author":"Akl","year":"1982","journal-title":"Utilitas Math."},{"key":"10.1016\/0167-6423(86)90003-1_BIB2","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0196-6774(82)90003-7","article-title":"On the average-case complexity of \u2018Bucketing\u2019 algorithms","volume":"3","author":"Akl","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0167-6423(86)90003-1_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF02251234","article-title":"The asymptotic behaviour of a distributive sorting method","volume":"31","author":"van Dam","year":"1983","journal-title":"Computing"},{"key":"10.1016\/0167-6423(86)90003-1_BIB4","series-title":"Sorting in linear expected time","author":"D\u00e9vai","year":"1980"},{"key":"10.1016\/0167-6423(86)90003-1_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02243418","article-title":"Average time behavior of distributive sorting algorithms","volume":"26","author":"Devroye","year":"1981","journal-title":"Computing"},{"key":"10.1016\/0167-6423(86)90003-1_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."},{"key":"10.1016\/0167-6423(86)90003-1_BIB7","volume":"Vol. 1","author":"Feller","year":"1970"},{"key":"10.1016\/0167-6423(86)90003-1_BIB8","series-title":"A note on direct addressing sort","author":"Connet","year":"1980"},{"key":"10.1016\/0167-6423(86)90003-1_BIB9","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","article-title":"Quicksort","volume":"5","author":"Hoare","year":"1962","journal-title":"Computer Journal"},{"key":"10.1016\/0167-6423(86)90003-1_BIB10","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":"Jakowski","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-6423(86)90003-1_BIB11","first-page":"28","article-title":"Implementing a distributive sort program","volume":"2","author":"Kowalik","year":"1981","journal-title":"J. Inform. Optim. Sci."},{"key":"10.1016\/0167-6423(86)90003-1_BIB12","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1145\/2163.358088","article-title":"Meansort","volume":"26","author":"Motzkin","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(86)90003-1_BIB13","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0020-0190(80)90069-1","article-title":"A fast sort algorithm, a hybrid of distributive and merge sorting","volume":"10","author":"van der Nat","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-6423(86)90003-1_BIB14","first-page":"499","article-title":"Can integers be sorted in linear worst case time?","volume":"25","author":"van der Nat","year":"1983","journal-title":"Angew. Inform.\/Appl. Inform."},{"key":"10.1016\/0167-6423(86)90003-1_BIB15","article-title":"Quicksort","author":"Sedgewick","year":"1979"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900031?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900031?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T11:50:30Z","timestamp":1553428230000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642386900031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":15,"alternative-id":["0167642386900031"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(86)90003-1","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}