{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T04:33:21Z","timestamp":1774586001393,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540792277","type":"print"},{"value":"9783540792284","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_22","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"246-257","source":"Crossref","is-referenced-by-count":6,"title":["Ratio Based Stable In-Place Merging"],"prefix":"10.1007","author":[{"given":"Pok-Son","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arne","family":"Kutzner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","volume-title":"Programming Pearls","author":"J. Bentley","year":"2000","unstructured":"Bentley, J.: Programming Pearls, 2nd edn. Addison-Wesley, Reading (2000)","edition":"2"},{"issue":"1\/3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0304-3975(02)00775-2","volume":"302","author":"J. Chen","year":"2003","unstructured":"Chen, J.: Optimizing stable in-place merging. Theoretical Computer Science\u00a0302(1\/3), 191\u2013210 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0020-0190(81)90065-X","volume":"12","author":"K. Dudzinski","year":"1981","unstructured":"Dudzinski, K., Dydek, A.: On a stable storage merging algorithm. Information Processing Letters\u00a012(1), 5\u20138 (1981)","journal-title":"Information Processing Letters"},{"issue":"1\/2","key":"22_CR4","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. Theoretical Computer Science\u00a0237(1\/2), 159\u2013181 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/0201004","volume":"1","author":"F.K. Hwang","year":"1972","unstructured":"Hwang, F.K., Lin, S.: A simple algorithm for merging two disjoint linearly ordered sets. SIAM J. Comput.\u00a01(1), 31\u201339 (1972)","journal-title":"SIAM J. Comput."},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/11611257_33","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"P.-S. Kim","year":"2006","unstructured":"Kim, P.-S., Kutzner, A.: On optimal and efficient in place merging. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol.\u00a03831, pp. 350\u2013359. Springer, Heidelberg (2006)"},{"key":"22_CR7","series-title":"Sorting and Searching","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1973)"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0020-0190(84)90112-1","volume":"18","author":"H. Mannila","year":"1984","unstructured":"Mannila, H.: A simple linear-time algorithm for in situ merging. Information Processing Letters\u00a018, 203\u2013208 (1984)","journal-title":"Information Processing Letters"},{"issue":"2","key":"22_CR9","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"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1093\/comjnl\/38.8.681","volume":"38","author":"A. Symvonis","year":"1995","unstructured":"Symvonis, A.: Optimal stable merging. Computer Journal\u00a038, 681\u2013690 (1995)","journal-title":"Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:14Z","timestamp":1619522054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_22","relation":{},"subject":[]}}