{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:15:32Z","timestamp":1726409732237},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642183805"},{"type":"electronic","value":"9783642183812"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18381-2_21","type":"book-chapter","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T16:01:51Z","timestamp":1294156911000},"page":"248-259","source":"Crossref","is-referenced-by-count":0,"title":["In-Place Sorting"],"prefix":"10.1007","author":[{"given":"Viliam","family":"Geffert","sequence":"first","affiliation":[]},{"given":"Jozef","family":"Gajdo\u0161","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s00224-006-1311-1","volume":"40","author":"G. Franceschini","year":"2007","unstructured":"Franceschini, G.: Sorting Stably, In-Place, with O(n lg n) Comparisons and O(n) Moves. Theory of Computing Systems\u00a040, 327\u2013353 (2007)","journal-title":"Theory of Computing Systems"},{"key":"21_CR2","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(n lg n) Comparisons and O(n) Moves. J.\u00a0Assoc.Comput. Mach.\u00a0\u00a052, 515\u2013537 (2005)","journal-title":"J.\u00a0Assoc.Comput. Mach.\u00a0"},{"key":"21_CR3","first-page":"333","volume":"25","author":"V. Geffert","year":"2006","unstructured":"Geffert, V., Koll\u00e1r, J.: Linear-time in-place selection with \n                  \n                    \n                  \n                  $\\varepsilon\\!\\cdot\\!n$\n                 element moves. Comput. & Informatics\u00a025, 333\u2013350 (2006)","journal-title":"Comput. & Informatics"},{"key":"21_CR4","volume-title":"The Art of Computer Programming, Sorting and Searching","author":"D. Knuth","year":"1998","unstructured":"Knuth, D.: The Art of Computer Programming, Sorting and Searching, 2nd edn., vol.\u00a03. Addison-Wesley, Reading (1973, 1998)","edition":"2"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1016\/0196-6774(92)90045-E","volume":"13","author":"J. Munro","year":"1992","unstructured":"Munro, J., Raman, V.: Sorting with minimum data movement. J.\u00a0Algorithms\u00a013, 374\u2013393 (1992)","journal-title":"J.\u00a0Algorithms"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(95)00225-1","volume":"165","author":"J. Munro","year":"1996","unstructured":"Munro, J., 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."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/3-540-56279-6_101","volume-title":"Proc. Internat. Symp. Algorithms and Comput","author":"K. Reinhardt","year":"1992","unstructured":"Reinhardt, K.: Sorting in-place with a worst case complexity of nlogn\u2009\u2212\u20091.3n\u2009+\u2009O(logn) comparisons and \u03b5\n                nlogn\u2009+\u2009O(1) transports. In: Proc. Internat. Symp. Algorithms and Comput, vol.\u00a0650, pp. 489\u2013498. Springer, Heidelberg (1992)"},{"key":"21_CR8","first-page":"114","volume-title":"Proc. Symp. Theory of Comput.","author":"D. Willard","year":"1982","unstructured":"Willard, D.: Maintaining dense sequential files in a dynamic environment. In: Proc. Symp. Theory of Comput., pp. 114\u2013121. ACM Press, New York (1982)"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2011: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18381-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T10:50:04Z","timestamp":1553338204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18381-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642183805","9783642183812"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18381-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}