{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T15:04:12Z","timestamp":1709305452802},"reference-count":13,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,8,1]],"date-time":"1991-08-01T00:00:00Z","timestamp":681004800000},"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":[[1991,8]]},"DOI":"10.1016\/0020-0190(91)90181-g","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"205-211","source":"Crossref","is-referenced-by-count":20,"title":["Splitsort\u2014an adaptive sorting algorithm"],"prefix":"10.1016","volume":"39","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[]},{"given":"Ola","family":"Petersson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90181-G_BIB1","series-title":"Proc. SIGAL Internat. Symp. on Algorithms","first-page":"251","article-title":"Sublinear merging and Natural Mergesort","volume":"450","author":"Carlsson","year":"1990"},{"issue":"11","key":"10.1016\/0020-0190(91)90181-G_BIB2","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/359024.359026","article-title":"Best sorting algorithms for nearly sorted lists","volume":"23","author":"Cook","year":"1980","journal-title":"Comm. ACM"},{"issue":"6","key":"10.1016\/0020-0190(91)90181-G_BIB3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1002\/spe.4380140603","article-title":"Exploiting partial order with Quicksort","volume":"14","author":"Dromey","year":"1984","journal-title":"Software\u2014Practice and Experience"},{"issue":"1","key":"10.1016\/0020-0190(91)90181-G_BIB4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0890-5401(89)90050-3","article-title":"A new measure of presortedness","volume":"83","author":"Estivill-Castro","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(91)90181-G_BIB5","first-page":"49","article-title":"A new representation of linear lists","author":"Guibas","year":"1977","journal-title":"Proc. 9th Ann. ACM Symp. on Theory of Computing"},{"issue":"3","key":"10.1016\/0020-0190(91)90181-G_BIB6","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/42392.42403","article-title":"Practical in-place merging","volume":"31","author":"Huang","year":"1988","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(91)90181-G_BIB7","series-title":"Proc. 1989 Workshop on Algorithms and Data Structures","first-page":"499","article-title":"Heapsort\u2014adapted for presorted files","volume":"382","author":"Levcopoulos","year":"1989"},{"key":"10.1016\/0020-0190(91)90181-G_BIB8","series-title":"Proc. 2nd Scandinavian Workshop on Algorithm Theory","first-page":"181","article-title":"Sorting shuffled monotone sequences","volume":"447","author":"Levcopoulos","year":"1990"},{"issue":"4","key":"10.1016\/0020-0190(91)90181-G_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\/0020-0190(91)90181-G_BIB10","series-title":"Proc. 4th GI Conf. on Theoretical Computer Science","first-page":"199","article-title":"Sorting presorted files","volume":"67","author":"Mehlhorn","year":"1979"},{"key":"10.1016\/0020-0190(91)90181-G_BIB11","series-title":"Data Structures and Algorithms, Vol. 1: Sorting and Searching","author":"Mehlhorn","year":"1984"},{"issue":"4","key":"10.1016\/0020-0190(91)90181-G_BIB12","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/BF01954897","article-title":"Encroaching lists as a measure of presortedness","volume":"28","author":"Skiena","year":"1988","journal-title":"BIT"},{"issue":"4","key":"10.1016\/0020-0190(91)90181-G_BIB13","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/3341.3348","article-title":"A class of sorting algorithms based on Quicksort","volume":"28","author":"Wainwright","year":"1985","journal-title":"Comm. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190181G?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190181G?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:24:59Z","timestamp":1555143899000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190181G"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,8]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,8]]}},"alternative-id":["002001909190181G"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90181-g","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,8]]}}}