{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:23Z","timestamp":1725663443850},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562870"},{"type":"electronic","value":"9783540475071"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56287-7_120","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:02:46Z","timestamp":1330254166000},"page":"380-391","source":"Crossref","is-referenced-by-count":0,"title":["Selection from read-only memory and sorting with optimum data movement"],"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,6,1]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"M. Blum, R. W. Floyd, V. Pratt, R. L. Rivest, and R. E. Tarjan, Time Bounds for Selection, Journal of Computer and System Sciences, 7 (1973) 448\u2013461.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"29_CR2","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1145\/360680.360691","volume":"18","author":"R. W. Floyd","year":"1975","unstructured":"R. W. Floyd and R. Rivest, Expected Time Bounds for Selection, Communications of the ACM, 18 (3) (1975) 165\u2013172.","journal-title":"Communications of the ACM"},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0022-0000(87)90002-X","volume":"34","author":"G. N. Frederickson","year":"1987","unstructured":"G. N. Frederickson, Upper Bounds for Time-Space Trade-offs in Sorting and Selection, Journal of Computer and System Sciences, 34 (1987) 19\u201326.","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR4","unstructured":"G. H. Gonnet, Handbook of Algorithms and Data Structures, Addison-Wesley (1984)."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C. A. R. Hoare","year":"1961","unstructured":"C. A. R. Hoare, Algorithms 64 PARTITION and Algorithm 65 FIND, Communications of the ACM 4 (1961), 321.","journal-title":"Communications of the ACM"},{"key":"29_CR6","unstructured":"D. E. Knuth, The Art of Computer Programming. Volume III: Sorting and Searching, Addison-Wesley (1973)."},{"key":"29_CR7","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, Proceedings, I.F.I.P. Congress, (Ed. C.V. Frieman) 19\u201327, North-Holland. Amsterdam. 1972."},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","volume":"12","author":"J. 1. Munro","year":"1980","unstructured":"J. 1. Munro and M. S. Paterson, Selection and Sorting with Limited Storage, Theoretical Computer Science, 12 (1980) 315\u2013323.","journal-title":"Theoretical Computer Science"},{"key":"29_CR9","first-page":"552","volume-title":"Lecture Notes in Computer Science","author":"J. I. Munro","year":"1989","unstructured":"J. I. Munro and V. Raman, Sorting with Minimum Data Movement, Proceedings of the Workshop on Algorithms and Data Structures, Ottawa, Lecture Notes in Computer Science, Springer Verlag 382 (1989), 552\u2013562; an improved version to appear in Journal of Algorithms."},{"key":"29_CR10","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":"29_CR11","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","volume":"13","author":"A. Schonage","year":"1976","unstructured":"A. Schonage, M. Paterson and N. Pippenger, Finding the median, Journal of Computer and System Sciences, 13 (1976), 184\u2013199.","journal-title":"Journal of Computer and System Sciences"}],"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-56287-7_120.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:49:04Z","timestamp":1619570944000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56287-7_120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562870","9783540475071"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-56287-7_120","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}