{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:48Z","timestamp":1725457008654},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642352607"},{"type":"electronic","value":"9783642352614"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35261-4_25","type":"book-chapter","created":{"date-parts":[[2012,12,13]],"date-time":"2012-12-13T20:59:41Z","timestamp":1355432381000},"page":"217-226","source":"Crossref","is-referenced-by-count":0,"title":["A General Method for Improving Insertion-Based Adaptive Sorting"],"prefix":"10.1007","author":[{"given":"Riku","family":"Saikkonen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eljas","family":"Soisalon-Soininen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Saikkonen, R.: Bulk Updates and Cache Sensitivity in Search Trees. PhD thesis, Helsinki University of Technology (2009)"},{"issue":"6","key":"25_CR2","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/BF01190160","volume":"9","author":"S. Carlsson","year":"1993","unstructured":"Carlsson, S., Levcopoulos, C., Petersson, O.: Sublinear merging and natural mergesort. Algorithmica\u00a09(6), 629\u2013648 (1993)","journal-title":"Algorithmica"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/3-540-09118-1_22","volume-title":"Theoretical Computer Science","author":"K. Mehlhorn","year":"1979","unstructured":"Mehlhorn, K.: Sorting Presorted Files. In: Weihrauch, K. (ed.) GI-TCS 1979. LNCS, vol.\u00a067, pp. 199\u2013212. Springer, Heidelberg (1979)"},{"issue":"2","key":"25_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0166-218X(93)E0160-Z","volume":"59","author":"O. Petersson","year":"1995","unstructured":"Petersson, O., Moffat, A.: A framework for adaptive sorting. Discrete Applied Mathematics\u00a059(2), 153\u2013179 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-642-02011-7_25","volume-title":"Experimental Algorithms","author":"R. Saikkonen","year":"2009","unstructured":"Saikkonen, R., Soisalon-Soininen, E.: Bulk-Insertion Sort: Towards Composite Measures of Presortedness. In: Vahrenhold, J. (ed.) SEA 2009. LNCS, vol.\u00a05526, pp. 269\u2013280. Springer, Heidelberg (2009)"},{"issue":"7","key":"25_CR6","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1002\/(SICI)1097-024X(199607)26:7<781::AID-SPE35>3.0.CO;2-B","volume":"126","author":"A. Moffat","year":"1996","unstructured":"Moffat, A., Eddy, G., Petersson, O.: Splaysort: Fast, versatile, practical. Software, Practice and Experience\u00a0126(7), 781\u2013797 (1996)","journal-title":"Software, Practice and Experience"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1109\/TC.1985.5009382","volume":"C-34","author":"H. Mannila","year":"1985","unstructured":"Mannila, H.: Measures of presortedness and optimal sorting algorithms. IEEE Transactions on Computers\u00a0C-34, 318\u2013325 (1985)","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"25_CR8","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1137\/S009753979732699X","volume":"30","author":"R. Cole","year":"2000","unstructured":"Cole, R.: On the dynamic finger conjecture for splay trees, part II: The proof. SIAM Journal on Computing\u00a030(1), 44\u201385 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Fredman, M.L.: Two applications of a probabilistic search technique: Sorting X+Y and building balanced search trees. In: 7th Annual ACM Symposium on Theory of Computing (STOC 1975), pp. 240\u2013244. ACM Press (1975)","DOI":"10.1145\/800116.803774"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/11427186_52","volume-title":"Experimental and Efficient Algorithms","author":"A. Elmasry","year":"2005","unstructured":"Elmasry, A., Hammad, A.: An Empirical Study for Inversions-Sensitive Sorting Algorithms. In: Nikoletseas, S.E. (ed.) WEA 2005. LNCS, vol.\u00a03503, pp. 597\u2013601. Springer, Heidelberg (2005)"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0020-0190(91)90181-G","volume":"39","author":"C. Levcopoulos","year":"1991","unstructured":"Levcopoulos, C., Petersson, O.: Splitsort \u2013 an adaptive sorting algorithm. Information Processing Letters\u00a039, 205\u2013211 (1991)","journal-title":"Information Processing Letters"},{"issue":"4","key":"25_CR12","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/146370.146381","volume":"24","author":"V. Estivill-Castro","year":"1992","unstructured":"Estivill-Castro, V., Wood, D.: A survey of adaptive sorting algorithms. ACM Computing Surveys\u00a024(4), 441\u2013476 (1992)","journal-title":"ACM Computing Surveys"},{"issue":"11","key":"25_CR13","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1002\/spe.4380231105","volume":"23","author":"J.L. Bentley","year":"1993","unstructured":"Bentley, J.L., McIlroy, M.D.: Engineering a sort function. Software, Practice and Experience\u00a023(11), 1249\u20131265 (1993)","journal-title":"Software, Practice and Experience"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35261-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T20:02:15Z","timestamp":1557432135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35261-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642352607","9783642352614"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35261-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}