{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T01:25:06Z","timestamp":1692408306834},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1980,4,1]],"date-time":"1980-04-01T00:00:00Z","timestamp":323395200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1980,4]]},"DOI":"10.1016\/0020-0190(80)90069-1","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T19:38:56Z","timestamp":1034019536000},"page":"163-167","source":"Crossref","is-referenced-by-count":12,"title":["A fast sorting algorithm, a hybrid of distributive and merge sorting"],"prefix":"10.1016","volume":"10","author":[{"given":"M.","family":"van der Nat","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(80)90069-1_BIB1","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/322123.322127","article-title":"A fast merging algorithm","volume":"26","author":"Brown","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(80)90069-1_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":"Information Processing Lett."},{"key":"10.1016\/0020-0190(80)90069-1_BIB3","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":"Information Processing Lett."},{"key":"10.1016\/0020-0190(80)90069-1_BIB4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/360680.360691","article-title":"Expected time bounds for selection","volume":"18","author":"Floyd","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(80)90069-1_BIB5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/322123.322128","article-title":"A counting approach to lower bounds for selection problems","volume":"26","author":"Fussenegger","year":"1979","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(80)90069-1_BIB6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(79)90013-9","article-title":"The practical significance of distributive paritioning sort","volume":"8","author":"Huits","year":"1979","journal-title":"Information Processing Lett."},{"key":"10.1016\/0020-0190(80)90069-1_BIB7","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0201004","article-title":"A simple algorithm for merging two disjoint linearly ordered sets","volume":"1","author":"Hwang","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(80)90069-1_BIB8","series-title":"Sorting ans Sort Systems","author":"Lorin","year":"1975"},{"key":"10.1016\/0020-0190(80)90069-1_BIB9","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0020-0190(79)90146-7","article-title":"Binary merging by partitioning","volume":"8","author":"van der Nat","year":"1979","journal-title":"Information Processing Lett."},{"key":"10.1016\/0020-0190(80)90069-1_BIB10","series-title":"Ph. D. Thesis","article-title":"Quicksort","author":"Sedgewick","year":"1979"},{"key":"10.1016\/0020-0190(80)90069-1_BIB11","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1145\/359619.359631","article-title":"Implementing quicksort programs","volume":"21","author":"Sedgewick","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(80)90069-1_BIB12","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1137\/0207002","article-title":"Minimean merging and sorting: an algorithm","volume":"7","author":"Tanner","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(80)90069-1_BIB13","series-title":"Report R-232","article-title":"Master's Thesis","author":"Seward","year":"1954"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019080900691?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019080900691?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T01:52:29Z","timestamp":1554774749000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019080900691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,4]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1980,4]]}},"alternative-id":["0020019080900691"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(80)90069-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1980,4]]}}}