{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:21Z","timestamp":1725663441311},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540549673"},{"type":"electronic","value":"9783540466123"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54967-6_74","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T23:21:39Z","timestamp":1330212099000},"page":"266-277","source":"Crossref","is-referenced-by-count":1,"title":["Fast stable in-place sorting with O(n) data moves"],"prefix":"10.1007","author":[{"given":"J. Ian","family":"Munro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"issue":"2","key":"18_CR1","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/320831.320833","volume":"3","author":"E. H. Friend","year":"1956","unstructured":"E. H. Friend, Sorting on Electronic Computers, Journal of the ACM, 3(2) (1956) 134\u2013168.","journal-title":"Journal of the ACM"},{"issue":"3","key":"18_CR2","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1145\/42392.42403","volume":"31","author":"B. C. Huang","year":"1988","unstructured":"B. C. Huang and M. A. Langston, Practical In-place Merging, Communications of the ACM, 31(3) (1988) 348\u2013352.","journal-title":"Communications of the ACM"},{"key":"18_CR3","unstructured":"B. C. Huang and M. A. Langston, Fast Stable Merging and Sorting in Constant Extra Space, Computing and Information, (1989), 71\u201379."},{"key":"18_CR4","unstructured":"D. E. Knuth, The Art of Computer Programming. Volume III: Sorting and Searching, Addison-Wesley (1973)."},{"key":"18_CR5","first-page":"744","volume":"10","author":"M. A. Kronrod","year":"1969","unstructured":"M. A. Kronrod, Optimal Ordering Algorithm without Operational Field, Soviet Math. Dokl. 10 (1969) 744\u2013746.","journal-title":"Soviet Math. Dokl."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"T. W. Lai and D. Wood, Implicit Selection, Proceedings of the Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science 318, Springer Verlag, (1988) 14\u201323.","DOI":"10.1007\/3-540-19487-8_2"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","volume":"21","author":"J. I. Munro","year":"1980","unstructured":"J. I. Munro, An Implicit Data Structure Supporting Insertion, Deletion, and Search in O(lg 2n) time, Journal of Computer and System Sciences, 21 (1980) 236\u2013250.","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"J. I. Munro and V. Raman, Sorting with Minimum Data Movement, Proceedings of Workshop on Algorithms and Data Structures, Ottawa, Lecture Notes in Computer Science, Springer Verlag 382 (1989) 552\u2013562; (revised version to appear in Journal of Algorithms)","DOI":"10.1007\/3-540-51542-9_46"},{"key":"18_CR9","unstructured":"J. I. Munro and V. Raman, Selection in Read-Only Memory and Sorting with Optimum Data Movement, submitted for publication."},{"key":"18_CR10","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/BF02017344","volume":"30","author":"J. I. Munro","year":"1990","unstructured":"J. I. Munro, V. Raman and J. S. Salowe, Stable In Situ Sorting and Minimum Data Movement, BIT 30 (1990) 220\u2013234.","journal-title":"BIT"},{"key":"18_CR11","unstructured":"V. Raman, Sorting In-Place with Minimum Data Movement, Ph.D. Thesis, Technical Report CS 91-12, Department of Computer Science, University of Waterloo (1991)."},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0206025","volume":"6","author":"L. T. Pardo","year":"1977","unstructured":"L. Trabb Pardo, Stable Sorting and Merging with Optimal Space and Time Bounds, SIAM J. of Computing 6 (1977) 351\u2013372.","journal-title":"SIAM J. of Computing"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J. W. J. Williams","year":"1964","unstructured":"J. W. J. Williams, Algorithm 232, Heapsort, Communications of the ACM, 7 (1964) 347\u2013348.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54967-6_74.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:00:56Z","timestamp":1640923256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54967-6_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540549673","9783540466123"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-54967-6_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}