{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:19Z","timestamp":1725663319213},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_46","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:08:10Z","timestamp":1330204090000},"page":"552-562","source":"Crossref","is-referenced-by-count":3,"title":["Sorting with minimum data movement (preliminary draft)"],"prefix":"10.1007","author":[{"given":"J. Ian","family":"Munro","sequence":"first","affiliation":[]},{"given":"Venkatesh","family":"Raman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Alpern, A. Chandra and M. Snir, A Model for Hierarchical Memory, Proceedings of the 19th STOC, New York, May 1987, pp 305\u2013314.","DOI":"10.1145\/28395.28428"},{"issue":"3","key":"46_CR2","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/321592.321600","volume":"17","author":"W. D. Frazer","year":"1970","unstructured":"W. D. Frazer and A. C. McKellar, Samplesort: A Sampling Approach to Minimal Storage Tree Sorting, JACM 17 (3), 1970 pp 496\u2013507.","journal-title":"JACM"},{"issue":"2","key":"46_CR3","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, JACM 3 (2), 1956 pp 134\u2013168.","journal-title":"JACM"},{"key":"46_CR4","unstructured":"D. E. Knuth, The Art of Computer Programming. Volume III: Sorting and Searching Addison-Wesley, 1973."},{"key":"46_CR5","first-page":"19","volume-title":"Proceedings, I.F.I.P. Congress","author":"D. E. Knuth","year":"1972","unstructured":"D. E. Knuth, Mathematical Analysis of Algorithms in Proceedings, I.F.I.P. Congress, pp 19\u201327, ed. C.V. Frieman, North-Holland, Amsterdam (1972)"},{"key":"46_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 pp 744\u2013746.","journal-title":"Soviet Math.Dokl."},{"key":"46_CR7","unstructured":"J. I. Munro, V. Raman and J. S. Salowe, Stable In Situ Sorting and Minimum Data Movement, manuscript."},{"key":"46_CR8","doi-asserted-by":"crossref","unstructured":"L. J. Slater, Generalized Hypergeometric Functions, Cambridge University Press (1966).","DOI":"10.2307\/2003571"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:21:57Z","timestamp":1605648117000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}