{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:45Z","timestamp":1725487665962},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540695066"},{"type":"electronic","value":"9783540695073"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-69507-3_29","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T17:35:58Z","timestamp":1184607358000},"page":"347-356","source":"Crossref","is-referenced-by-count":2,"title":["A Simple Algorithm for Stable Minimum Storage Merging"],"prefix":"10.1007","author":[{"given":"Pok-Son","family":"Kim","sequence":"first","affiliation":[]},{"given":"Arne","family":"Kutzner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","volume-title":"The Art of Computer Programming","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol.\u00a03. Addison-Wesley, London (1973)"},{"key":"29_CR2","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, 5\u20138 (1981)","journal-title":"Information Processing Letters"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1007\/978-3-540-30140-0_63","volume-title":"Algorithms \u2013 ESA 2004","author":"P.S. Kim","year":"2004","unstructured":"Kim, P.S., Kutzner, A.: Stable Minimum Storage Merging by Symmetric Comparisons. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 714\u2013723. Springer, Heidelberg (2004)"},{"key":"29_CR4","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"},{"key":"29_CR5","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, 159\u2013181 (2000)","journal-title":"Theoretical Computer Science"},{"key":"29_CR6","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, 191\u2013210 (2003)","journal-title":"Theoretical Computer Science"},{"key":"29_CR7","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":"29_CR8","first-page":"1256","volume":"186","author":"M.A. Kronrod","year":"1969","unstructured":"Kronrod, M.A.: An Optimal Ordering Algorithm without a Field Operation. Dokladi Akad. Nauk SSSR\u00a0186, 1256\u20131258 (1969)","journal-title":"Dokladi Akad. Nauk SSSR"},{"key":"29_CR9","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., Ukkonen, E.: A Simple Linear-Time Algorithm for in Situ Merging. Information Processing Letters\u00a018, 203\u2013208 (1984)","journal-title":"Information Processing Letters"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1137\/0201004","volume":"1","author":"F. Hwang","year":"1972","unstructured":"Hwang, F., Lin, S.: A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets. SIAM J. Comput.\u00a01, 31\u201339 (1972)","journal-title":"SIAM J. Comput."},{"key":"29_CR11","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2007: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69507-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,18]],"date-time":"2019-02-18T01:08:40Z","timestamp":1550452120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69507-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540695066","9783540695073"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69507-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}