{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:31Z","timestamp":1725456751364},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029637","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"416-422","source":"Crossref","is-referenced-by-count":1,"title":["Splitsort\u2014an adaptive sorting algorithm"],"prefix":"10.1007","author":[{"given":"Christos","family":"Levcopoulos","sequence":"first","affiliation":[]},{"given":"Ola","family":"Petersson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"S. Carlsson, C. Levcopoulos, and O. Petersson. Sublinear merging and Natural Merge Sort. In Proc. SIGAL Int. Symp. on Algorithms. LNCS, Springer-Verlag, 1990. To appear.","DOI":"10.1007\/3-540-52921-7_74"},{"issue":"11","key":"46_CR2","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/359024.359026","volume":"23","author":"C.R. Cook","year":"1980","unstructured":"C.R. Cook and D.J. Kim. Best sorting algorithms for nearly sorted lists. Communications of the ACM, 23(11):620\u2013624, 1980.","journal-title":"Communications of the ACM"},{"issue":"1","key":"46_CR3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0890-5401(89)90050-3","volume":"83","author":"V. Estivill-Castro","year":"1989","unstructured":"V. Estivill-Castro and D. Wood. A new measure of presortedness. Information and Computation, 83(1):111\u2013119, 1989.","journal-title":"Information and Computation"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"L.J. Guibas, E.M. McCreight, M.F. Plass, and J.R. Roberts. A new representation of linear lists. In Proc. 9th Annual ACM Symposium on Theory of Computing, pages 49\u201360, 1977.","DOI":"10.1145\/800105.803395"},{"issue":"3","key":"46_CR5","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/42392.42403","volume":"31","author":"B-C. Huang","year":"1988","unstructured":"B-C. Huang and M.A. Langston. Practical in-place merging. CACM, 31(3):348\u2013352, 1988.","journal-title":"CACM"},{"key":"46_CR6","unstructured":"C. Levcopoulos and O. Petersson. Heapsort\u2014adapted for presorted files. In Proc. 1989 WADS, pages 499\u2013509. LNCS 382, Springer-Verlag, 1989."},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"C. Levcopoulos and O. Petersson. Sorting shuffled monotone sequences. In Proc. 2nd SWAT. LNCS, Springer-Verlag, 1990. To appear.","DOI":"10.1007\/3-540-52846-6_88"},{"issue":"4","key":"46_CR8","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/TC.1985.5009382","volume":"C-34","author":"H. Mannila","year":"1985","unstructured":"H. Mannila. Measures of presortedness and optimal sorting algorithms. IEEE Transactions on Computers, C-34(4):318\u2013325, 1985.","journal-title":"IEEE Transactions on Computers"},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn. Data Structures and Algorithms, Vol 1: Sorting and Searching. 1984.","DOI":"10.1007\/978-3-642-69672-5"},{"issue":"4","key":"46_CR10","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/BF01954897","volume":"28","author":"S.S. Skiena","year":"1988","unstructured":"S.S. Skiena. Encroaching lists as a measure of presortedness. BIT, 28(4):775\u2013784, 1988.","journal-title":"BIT"},{"issue":"4","key":"46_CR11","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/3341.3348","volume":"28","author":"R.L. Wainwright","year":"1985","unstructured":"R.L. Wainwright. A class of sorting algorithms based on Quicksort. CACM, 28(4):396\u2013402, 1985.","journal-title":"CACM"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029637","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T08:15:21Z","timestamp":1586592921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029637"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0029637","relation":{},"subject":[]}}