{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T15:53:04Z","timestamp":1672242784114},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,8,1]],"date-time":"1996-08-01T00:00:00Z","timestamp":838857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1996,8]]},"DOI":"10.1007\/bf01940644","type":"journal-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T14:52:21Z","timestamp":1123080741000},"page":"151-160","source":"Crossref","is-referenced-by-count":1,"title":["Fast stable in-place sorting withO(n) data moves"],"prefix":"10.1007","volume":"16","author":[{"given":"J. I.","family":"Munro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"BF01940644_CR1","doi-asserted-by":"crossref","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":"BF01940644_CR2","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/42392.42403","volume":"31","author":"B. C. Huang","year":"1988","unstructured":"B. C. Huang and M. A. Langsten, Practical In-place Merging,Communications of the ACM,31(3) (1988), 348\u2013352.","journal-title":"Communications of the ACM"},{"key":"BF01940644_CR3","unstructured":"B. C. Huang and M. A. Langston, Fast Stable Merging and Sorting in Constant Extra Space,Proceedings of the International Conference on Computing and Information, 1989, pp. 71\u201380."},{"key":"BF01940644_CR4","first-page":"410","volume-title":"Lecture Notes in Computer Science, Vol. 621","author":"J. Katajainen","year":"1992","unstructured":"J. Katajainen and T. Pasanen, Sorting Multisets Stably in Minimum Space,Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 621, Springer-Verlag, Berlin, 1992, pp. 410\u2013421."},{"key":"BF01940644_CR5","volume-title":"The Art of Computer Programming, Vol. III","author":"D. E. Knuth","year":"1973","unstructured":"D. E. Knuth,The Art of Computer Programming, Vol. III, Addison-Wesley, Reading, MA, 1973."},{"key":"BF01940644_CR6","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":"BF01940644_CR7","first-page":"14","volume-title":"Lecture Notes in Computer Science, Vol. 318","author":"T. W. Lai","year":"1988","unstructured":"T. W. Lai and D. Wood, Implicit Selection,Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, Lecture Notes in Computer Science, Vol. 318, Springer-Verlag, Berlin, 1988, pp. 14\u201323."},{"key":"BF01940644_CR8","doi-asserted-by":"crossref","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 inO(lg2 n) Time,Journal of Computer and System Sciences,21 (1980), 236\u2013250.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF01940644_CR9","first-page":"266","volume-title":"Lecture Notes in Computer Science, Vol. 560","author":"J. I. Munro","year":"1991","unstructured":"J. I. Munro and V. Raman, Fast Stable In-Place Sorting withO(n) Data Moves,Proceedings ofthe 11th FST & TCS Conference, New Delhi, Lecture Notes in Computer Science, Vol. 560, Springer-Verlag, Berlin, 1991, pp. 266\u2013277."},{"key":"BF01940644_CR10","first-page":"473","volume-title":"Lecture Notes in Computer Science, Vol. 519","author":"J. I. Munro","year":"1991","unstructured":"J. I. Munro and V. Raman, Sorting Multisets and Vectors In-Place,Proceedings of the 2nd Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, Vol. 519, Springer-Verlag, Berlin, 1991, pp. 473\u2013480."},{"key":"BF01940644_CR11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0196-6774(92)90045-E","volume":"13","author":"J. I. Munro","year":"1992","unstructured":"J. I. Munro and V. Raman, Sorting with Minimum Data Movement,Journal of Algorithms,13 (1992), 374\u2013393.","journal-title":"Journal of Algorithms"},{"key":"BF01940644_CR12","first-page":"380","volume-title":"Lecture Notes in Computer Science, Vol. 652","author":"J. I. Munro","year":"1992","unstructured":"J. I. Munro and V. Raman, Selection from Read-Only Memory and Sorting with Optimum Data Movement,Proceedings of the 12th FST & TCS Conference, New Delhi, Lecture Notes in Computer Science, Vol. 652, Springer-Verlag, Berlin, 1992, pp. 380\u2013391; to appear inTheoretical Computer Science."},{"key":"BF01940644_CR13","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":"BF01940644_CR14","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":"BF01940644_CR15","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0206025","volume":"6","author":"L. Trabb Pardo","year":"1977","unstructured":"L. Trabb Pardo, Stable Sorting and Merging with Optimal Space and Time Bounds,SIAM Journal of Computing,6 (1977), 351\u2013372.","journal-title":"SIAM Journal of Computing"},{"key":"BF01940644_CR16","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":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940644.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01940644\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01940644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,14]],"date-time":"2021-07-14T17:09:22Z","timestamp":1626282562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01940644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,8]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,8]]}},"alternative-id":["BF01940644"],"URL":"https:\/\/doi.org\/10.1007\/bf01940644","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,8]]}}}