{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T15:50:29Z","timestamp":1672242629374},"reference-count":23,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0196-6774(92)90045-e","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"374-393","source":"Crossref","is-referenced-by-count":8,"title":["Sorting with minimum data movement"],"prefix":"10.1016","volume":"13","author":[{"given":"J","family":"Ian Munro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(92)90045-E_BIB1","series-title":"Proceedings, 19th Annual ACM Symp. on Theory of Computing","first-page":"305","article-title":"A model for hierarchical memory","author":"Aggarwal","year":"1987"},{"key":"10.1016\/0196-6774(92)90045-E_BIB2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01931688","article-title":"Recursive samplesort","volume":"18","author":"Apers","year":"1978","journal-title":"BIT"},{"key":"10.1016\/0196-6774(92)90045-E_BIB3","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","article-title":"Time bounds for selection","volume":"7","author":"Blum","year":"1973","journal-title":"J. Comput. System Sci."},{"issue":"No. 12","key":"10.1016\/0196-6774(92)90045-E_BIB4","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","article-title":"Algorithm 245, Treesort","volume":"7","author":"Floyd","year":"1964","journal-title":"Comm. ACM"},{"issue":"No. 3","key":"10.1016\/0196-6774(92)90045-E_BIB5","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/360680.360691","article-title":"Expected time bounds for selection","volume":"18","author":"Floyd","year":"1975","journal-title":"Comm. ACM"},{"issue":"No. 3","key":"10.1016\/0196-6774(92)90045-E_BIB6","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/321592.321600","article-title":"Samplesort: A sampling approach to minimal storage tree sorting","volume":"17","author":"Frazer","year":"1970","journal-title":"J. Assoc. Comput. Mach."},{"issue":"No. 2","key":"10.1016\/0196-6774(92)90045-E_BIB7","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1145\/320831.320833","article-title":"Sorting on electronic computers","volume":"3","author":"Friend","year":"1956","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(92)90045-E_BIB8","article-title":"The Heap as a Data Structure","author":"Gonnet","year":"1975"},{"key":"10.1016\/0196-6774(92)90045-E_BIB9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(75)90001-0","article-title":"Priority queues with update and finding minimum spanning trees","volume":"4","author":"Johnson","year":"1975","journal-title":"Inform. Process. Lett."},{"issue":"No. 3","key":"10.1016\/0196-6774(92)90045-E_BIB10","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1145\/42392.42403","article-title":"Practical in-place merging","volume":"31","author":"Huang","year":"1988","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(92)90045-E_BIB11","author":"Knuth","year":"1973"},{"key":"10.1016\/0196-6774(92)90045-E_BIB12","series-title":"Proceedings, I.F.I.P. Congress","first-page":"19","article-title":"Mathematical analysis of algorithms","author":"Knuth","year":"1972"},{"key":"10.1016\/0196-6774(92)90045-E_BIB13","series-title":"Proceedings, Scandinavian Workshop on Algorithm Theory","first-page":"14","article-title":"Implicit selection","volume":"Vol. 318","author":"Lai","year":"1988"},{"key":"10.1016\/0196-6774(92)90045-E_BIB14","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1016\/0022-0000(80)90037-9","article-title":"An implicit data structure supporting insertion, deletion, and search in O(lg2 n) time","volume":"21","author":"Munro","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(92)90045-E_BIB15","series-title":"Proceedings, Workshop on Algorithms and Data Structures","first-page":"552","article-title":"Sorting with minimum data movement","volume":"Vol. 382","author":"Munro","year":"1989"},{"key":"10.1016\/0196-6774(92)90045-E_BIB16","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/BF02017344","article-title":"Stable in situ sorting and minimum data movement","volume":"30","author":"Munro","year":"1990","journal-title":"BIT"},{"issue":"No. 11","key":"10.1016\/0196-6774(92)90045-E_BIB17","doi-asserted-by":"crossref","first-page":"878","DOI":"10.1145\/182.358440","article-title":"An efficient dynamic selection method","volume":"26","author":"Postmus","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(92)90045-E_BIB18","article-title":"Sorting In-Place with Minimum Data Movement","author":"Raman","year":"1991"},{"key":"10.1016\/0196-6774(92)90045-E_BIB19","series-title":"Generalized Hypergeometric Functions","author":"Slater","year":"1966"},{"key":"10.1016\/0196-6774(92)90045-E_BIB20","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","article-title":"Data Structures and Network Algorithms","author":"Tarjan","year":"1983"},{"key":"10.1016\/0196-6774(92)90045-E_BIB21","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0206025","article-title":"Stable sorting and merging with optimal space and time bounds","volume":"6","author":"Trabb Pardo","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90045-E_BIB22","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0020-0190(90)90086-D","article-title":"Worst-case analysis of a generalized heapsort algorithm","volume":"36","author":"Paulik","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(92)90045-E_BIB23","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","article-title":"Algorithm 232, Heapsort","volume":"7","author":"Williams","year":"1964","journal-title":"Comm. ACM"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749290045E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749290045E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T00:01:10Z","timestamp":1625443270000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749290045E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["019667749290045E"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(92)90045-e","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}