{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T23:42:14Z","timestamp":1723160534993},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[1993,6,1]],"date-time":"1993-06-01T00:00:00Z","timestamp":738892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1993,6]]},"DOI":"10.1007\/bf01190160","type":"journal-article","created":{"date-parts":[[2005,2,17]],"date-time":"2005-02-17T22:43:07Z","timestamp":1108680187000},"page":"629-648","source":"Crossref","is-referenced-by-count":13,"title":["Sublinear merging and natural mergesort"],"prefix":"10.1007","volume":"9","author":[{"given":"Svante","family":"Carlsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ola","family":"Petersson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Data Structures and Algorithms, Vol. 1","author":"K. Mehlhorn","year":"1984","unstructured":"K. Mehlhorn.Data Structures and Algorithms, Vol. 1. Springer-Verlag, Berlin, 1984."},{"issue":"3","key":"CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0019-9958(58)80001-7","volume":"1","author":"W. H. Burge","year":"1958","unstructured":"W. H. Burge. Sorting, trees, and measures of order.Information and Control, 1(3):181?197, 1958.","journal-title":"Information and Control"},{"issue":"11","key":"CR3","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?624, 1980.","journal-title":"Communications of the ACM"},{"key":"CR4","volume-title":"The Art of Computer Programming, Vol. 3","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth.The Art of Computer Programming, Vol. 3. Addison-Wesley, Reading, Mass., 1973."},{"issue":"4","key":"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, 34(4):318?325, 1985.","journal-title":"IEEE Transactions on Computers"},{"key":"CR6","first-page":"422","volume-title":"Lecture Notes in Computer Science, Vol. 621","author":"O. Petersson","year":"1992","unstructured":"O. Petersson and A. Moffat. A framework for adaptive sorting. InProceedings of the Third Scandinavian Workshop on Algorithm Theory, pp. 422?433. Lecture Notes in Computer Science, Vol. 621, Springer-Verlag, Berlin, 1992."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/0304-3975(76)90078-5","volume":"1","author":"M. L. Fredman","year":"1976","unstructured":"M. L. Fredman. How good is the information theory bound in sorting?Theoretical Computer Science, 1:355?361, 1976.","journal-title":"Theoretical Computer Science"},{"key":"CR8","volume-title":"Ph.D. thesis","author":"O. Petersson","year":"1990","unstructured":"O. Petersson. Adaptive Sorting. Ph.D. thesis, Department of Computer Science, Lund University, Lund, 1990."},{"issue":"4","key":"CR9","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0020-0190(84)90112-1","volume":"18","author":"H. Mannila","year":"1984","unstructured":"H. Mannila and E. Ukkonen. A simple linear-time algorithm for in situ merging.Information Processing Letters, 18(4):203?208, 1984.","journal-title":"Information Processing Letters"},{"key":"CR10","unstructured":"A. Moffat. Adaptive merging and a naturally Natural Merge Sort. InProceedings of the 14th Australian Computer Science Conference, pp. 08.1?08.8, 1991."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190160.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01190160\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01190160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T13:08:10Z","timestamp":1556629690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01190160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":10,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["BF01190160"],"URL":"https:\/\/doi.org\/10.1007\/bf01190160","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}