{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:04Z","timestamp":1725663364078},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540529217"},{"type":"electronic","value":"9783540471776"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52921-7_74","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:48:13Z","timestamp":1330206493000},"page":"251-260","source":"Crossref","is-referenced-by-count":11,"title":["Sublinear merging and natural merge sort"],"prefix":"10.1007","author":[{"given":"Svante","family":"Carlsson","sequence":"first","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]},{"given":"Ola","family":"Petersson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"issue":"2","key":"26_CR1","first-page":"154","volume":"12","author":"T. Altman","year":"1989","unstructured":"T. Altman and Y. Igarashi. Roughly sorting: sequential and parallel approach. Journal of Information Processing, 12(2):154\u2013158, 1989.","journal-title":"Journal of Information Processing"},{"issue":"1","key":"26_CR2","doi-asserted-by":"publisher","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":"26_CR3","volume-title":"Fundamentals of Computer Algorithms","author":"E. Horowitz","year":"1984","unstructured":"E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms. Computer Science Press, Rockville, Maryland, 1984."},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"C. Levcopoulos and O. Petersson. Heapsort\u2014adapted for presorted files. In Proc. 2nd SWAT. LNCS, Springer-Verlag, 1990. To appear.","DOI":"10.1007\/3-540-51542-9_41"},{"issue":"4","key":"26_CR5","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1109\/TC.1985.5009382","volume":"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":"26_CR6","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":"26_CR7","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"}],"container-title":["Lecture Notes in Computer Science","Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52921-7_74.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:49Z","timestamp":1605648349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52921-7_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540529217","9783540471776"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-52921-7_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}