{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T05:05:37Z","timestamp":1733461537041,"version":"3.30.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"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":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0304-3975(98)00181-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T20:30:26Z","timestamp":1027629026000},"page":"29-40","source":"Crossref","is-referenced-by-count":2,"title":["Presorting algorithms: An average-case point of view"],"prefix":"10.1016","volume":"242","author":[{"given":"Hsien-Kuei","family":"Hwang","sequence":"first","affiliation":[]},{"given":"Bo-Yin","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yeong-Nan","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00181-9_BIB1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0019-9958(58)80001-7","article-title":"Sorting, trees, and measures of order","volume":"1","author":"Burge","year":"1958","journal-title":"Inform. and Control"},{"key":"10.1016\/S0304-3975(98)00181-9_BIB2","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","article-title":"Spearman's footrule as a measure of disarray","volume":"39","author":"Diaconis","year":"1977","journal-title":"J. Roy. Soc. Statist. Ser. B"},{"key":"10.1016\/S0304-3975(98)00181-9_BIB3","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/BF01177551","article-title":"Mellin transforms and asymptotics: the mergesort recurrence","volume":"31","author":"Flajolet","year":"1994","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(98)00181-9_BIB4","doi-asserted-by":"crossref","unstructured":"M.A. Fligner, J.S. Verducci (Eds.), Probability models and statistical analysis, for ranking data, Lecture Notes in Statistics, vol. 80, Springer, Berlin, 1993.","DOI":"10.1007\/978-1-4612-2738-0"},{"year":"1981","series-title":"Mathematics for the Analysis of Algorithms","author":"Greene","key":"10.1016\/S0304-3975(98)00181-9_BIB5"},{"key":"10.1016\/S0304-3975(98)00181-9_BIB6","doi-asserted-by":"crossref","unstructured":"H.-K. Hwang, Asymptotic expansions of mergesort recurrences, Acta Inform., to appear.","DOI":"10.1007\/s002360050147"},{"key":"10.1016\/S0304-3975(98)00181-9_BIB7","unstructured":"D.E. Knuth, The Art of Computer Programming, vol. III, Sorting and Searching. Addison-Wesley, Reading, MA. 1973."},{"key":"10.1016\/S0304-3975(98)00181-9_BIB8","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/rsa.3240070403","article-title":"Optimal sampling strategies for quicksort","volume":"7","author":"McGeoch","year":"1995","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/S0304-3975(98)00181-9_BIB9","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/TC.1985.5009382","article-title":"Measures of presortedness and optimal sorting algorithms","volume":"34","author":"Mannila","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(98)00181-9_BIB10","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, Sorting presorted files, in: Theoretical Computer Science (4th GI Conference, Aachen, 1979), pp. 199\u2013212, Lecture Notes in Computer Science, vol. 67, Springer Berlin, 1979.","DOI":"10.1007\/3-540-09118-1_22"},{"key":"10.1016\/S0304-3975(98)00181-9_BIB11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0166-218X(93)E0160-Z","article-title":"A framework for adaptive sorting","volume":"59","author":"Petersson","year":"1995","journal-title":"Discrete Appl. Math."},{"year":"1988","series-title":"Algorithms","author":"Sedgewick","key":"10.1016\/S0304-3975(98)00181-9_BIB12"},{"key":"10.1016\/S0304-3975(98)00181-9_BIB13","series-title":"Handbook of Theoretical Computer Science, vol. A, Algorithms and Complexity","first-page":"431","article-title":"Average-case analysis of algorithms and data structures","author":"Vitter","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001819?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001819?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,5]],"date-time":"2024-12-05T07:10:53Z","timestamp":1733382653000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001819"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0304397598001819"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00181-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}