{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:08:55Z","timestamp":1725548935420},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_52","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T18:06:19Z","timestamp":1267553179000},"page":"629-640","source":"Crossref","is-referenced-by-count":2,"title":["Sorting Stably, In-Place, with O(n log n) Comparisons and O(n) Moves"],"prefix":"10.1007","author":[{"given":"Gianni","family":"Franceschini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","unstructured":"Franceschini, G., Geffert, V.: An In-Place Sorting with O(nlogn)\u00a0Comparisons and O(n)\u00a0Moves. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, FOCS (2003)"},{"key":"52_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45061-0_27","volume-title":"Automata, Languages and Programming","author":"G. Franceschini","year":"2003","unstructured":"Franceschini, G., Grossi, R.: Optimal cache-oblivious implicit dictionaries. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719. Springer, Heidelberg (2003)"},{"issue":"1","key":"52_CR3","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. The Computer Journal\u00a05(1), 10\u201316 (1962)","journal-title":"The Computer Journal"},{"key":"52_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/3-540-55706-7_37","volume-title":"Algorithm Theory - SWAT \u201992","author":"J. Katajainen","year":"1992","unstructured":"Katajainen, J., Pasanen, T.: Sorting multisets stably in minimum space. In: Nurmi, O., Ukkonen, E. (eds.) SWAT 1992. LNCS, vol.\u00a0621, pp. 410\u2013421. Springer, Heidelberg (1992)"},{"issue":"4","key":"52_CR5","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/BF01994842","volume":"32","author":"J. Katajainen","year":"1992","unstructured":"Katajainen, J., Pasanen, T.: Stable minimum space partitioning in linear time. BIT\u00a032(4), 580\u2013585 (1992)","journal-title":"BIT"},{"key":"52_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."},{"key":"52_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":"52_CR8","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."},{"key":"52_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/3-540-19487-8_2","volume-title":"SWAT \u201988","author":"T.W. Lai","year":"1988","unstructured":"Lai, T.W., Wood, D.: Implicit selection. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol.\u00a0318, pp. 14\u201323. Springer, Heidelberg (1988)"},{"key":"52_CR10","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(86)90043-7","volume":"33","author":"J.I. Munro","year":"1986","unstructured":"Munro, J.I.: 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":"52_CR11","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(92)90045-E","volume":"13","author":"J.I. Munro","year":"1992","unstructured":"Munro, J.I., Raman, V.: Sorting with minimum data movement. J.\u00a0Algorithms\u00a013, 374\u2013393 (1992)","journal-title":"J.\u00a0Algorithms"},{"key":"52_CR12","first-page":"151","volume":"16","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I., Raman, V.: Fast stable in-place sorting with O(n) data moves. Algorithmica\u00a016, 151\u2013160 (1996)","journal-title":"Algorithmica"},{"key":"52_CR13","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","volume":"165","author":"J.I. Munro","year":"1996","unstructured":"Munro, J.I., Raman, V.: Selection from read-only memory and sorting with minimum data movement. Theoret. Comput. Sci.\u00a0165, 311\u2013323 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"52_CR14","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":"52_CR15","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"},{"key":"52_CR16","first-page":"347","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams, J.W.J.: Heapsort (Algorithm\u00a0232). Comm. Assoc. Comput. Mach.\u00a07, 347\u2013348 (1964)","journal-title":"Comm. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:29:54Z","timestamp":1605760194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}