{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:52Z","timestamp":1725543472944},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540357537"},{"type":"electronic","value":"9783540357551"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_10","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"77-89","source":"Crossref","is-referenced-by-count":0,"title":["Sorting by Merging or Merging by Sorting?"],"prefix":"10.1007","author":[{"given":"Gianni","family":"Franceschini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1145\/1082036.1082037","volume":"52","author":"G. Franceschini","year":"2005","unstructured":"Franceschini, G., Geffert, V.: An In-Place Sorting with O(nlogn)\u00a0Comparisons and O(n)\u00a0Moves. Journal of the ACM\u00a052, 515\u2013537 (2005)","journal-title":"Journal of the ACM"},{"key":"10_CR2","first-page":"744","volume":"10","author":"M.A. Kronrod","year":"1969","unstructured":"Kronrod, M.A.: Optimal ordering algorithm without operational field. Soviet Math. Dokl.\u00a010, 744\u2013746 (1969)","journal-title":"Soviet Math. Dokl."},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF00299635","volume":"26","author":"C. Levcopoulos","year":"1988","unstructured":"Levcopoulos, C., Overmars, M.H.: A balanced search tree with O(1) worst-case update time. Acta Informatica\u00a026(3), 269\u2013277 (1988)","journal-title":"Acta Informatica"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/3-540-54945-5_71","volume-title":"ISA \u201991 Algorithms","author":"A. Andersson","year":"1991","unstructured":"Andersson, A., Lai, T.W.: Comparison\u2013efficient and write\u2013optimal searching and sorting. In: Hsu, W.-L., Lee, R.C.T. (eds.) ISA 1991. LNCS, vol.\u00a0557, pp. 273\u2013282. Springer, Heidelberg (1991)"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1007\/3-540-57568-5_243","volume-title":"Algorithms and Computation","author":"R. Fleischer","year":"1993","unstructured":"Fleischer, R.: A simple balanced search tree with O(1) worst-case update time. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol.\u00a0762, pp. 138\u2013146. Springer, Heidelberg (1993)"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0020-0190(99)00038-1","volume":"70","author":"J. Katajainen","year":"1999","unstructured":"Katajainen, J., Pasanen, T.: In-place sorting with fewer moves. Inform. Process. Lett.\u00a070, 31\u201337 (1999)","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/322063.322064","volume":"25","author":"E.C. Horvath","year":"1978","unstructured":"Horvath, E.C.: Stable sorting in asymptotically optimal time and extra space. Journal of the ACM\u00a025(2), 177\u2013199 (1978)","journal-title":"Journal of the ACM"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0206025","volume":"6","author":"L.T. Pardo","year":"1977","unstructured":"Pardo, L.T.: Stable sorting and merging with optimal space and time bounds. SIAM Journal on Computing\u00a06(2), 351\u2013372 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/0196-6774(87)90050-2","volume":"8","author":"J. Salowe","year":"1987","unstructured":"Salowe, J., Steiger, W.: Simplified stable merging tasks. Journal of Algorithms\u00a08(4), 557\u2013571 (1987)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1145\/42392.42403","volume":"31","author":"B.C. Huang","year":"1988","unstructured":"Huang, B.C., Langston, M.A.: Practical in-place merging. Communications of the ACM, CACM\u00a031(3), 348\u2013352 (1988)","journal-title":"Communications of the ACM, CACM"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1145\/308386.308458","volume-title":"PODS 1988. Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"B.C. Huang","year":"1988","unstructured":"Huang, B.C., Langston, M.A.: Stable set and multiset operations in optimal time and space. In: ACM (ed.) PODS 1988. Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 288\u2013293. ACM Press, New York (1988)"},{"key":"10_CR12","first-page":"681","volume":"38","author":"A. Symvonis","year":"1995","unstructured":"Symvonis, A.: Optimal stable merging. Comput.\u00a0J.\u00a038, 681\u2013690 (1995)","journal-title":"Comput.\u00a0J."},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(98)00162-5","volume":"237","author":"V. Geffert","year":"2000","unstructured":"Geffert, V., Katajainen, J., Pasanen, T.: Asymptotically efficient in-place merging. Theoret. Comput. Sci.\u00a0237, 159\u2013181 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"302","key":"10_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0304-3975(02)00775-2","volume":"1-3","author":"J. Chen","year":"2003","unstructured":"Chen, J.: Optimizing stable in-place merging. Theor. Comput. Sci.\u00a01-3(302), 191\u2013210 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"10_CR15","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 Comp. Surveys\u00a024(4), 441\u2013476 (1992)","journal-title":"ACM Comp. Surveys"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J. Munro","year":"1986","unstructured":"Munro, J.: An implicit data structure supporting insertion, deletion, and search in O(log2\n                           n) time. J.\u00a0Comput. System Sci.\u00a033, 66\u201374 (1986)","journal-title":"J.\u00a0Comput. System Sci."},{"key":"10_CR17","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:10Z","timestamp":1619507950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11785293_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}