{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:57:56Z","timestamp":1775145476497,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6133,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1016\/0304-3975(95)00225-1","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"311-323","source":"Crossref","is-referenced-by-count":50,"title":["Selection from read-only memory and sorting with minimum data movement"],"prefix":"10.1016","volume":"165","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":"78","reference":[{"key":"10.1016\/0304-3975(95)00225-1_BIB1","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."},{"key":"10.1016\/0304-3975(95)00225-1_BIB2","series-title":"Proc. 6th ACM-SIAM Symp. on Discrete Algorithms","first-page":"28","article-title":"Selecting the median","author":"Dor","year":"1995"},{"issue":"3","key":"10.1016\/0304-3975(95)00225-1_BIB3","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"},{"key":"10.1016\/0304-3975(95)00225-1_BIB4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0022-0000(87)90002-X","article-title":"Upper bounds for time-space trade-offs in sorting and selection","volume":"34","author":"Frederickson","year":"1987","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00225-1_BIB5","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","article-title":"Algorithms 64 PARTITION and Algorithm 65 FIND","volume":"4","author":"Hoare","year":"1961","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(95)00225-1_BIB6","series-title":"Urn Models And Their Application, An Approach to Modern Discrete Probability Theory","author":"Johnson","year":"1977"},{"key":"10.1016\/0304-3975(95)00225-1_BIB7","series-title":"The Art of Computer Programming. Volume III: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(95)00225-1_BIB8","series-title":"Proc. I.F.I.P. Congress","first-page":"19","article-title":"Mathematical analysis of algorithms","author":"Knuth","year":"1972"},{"key":"10.1016\/0304-3975(95)00225-1_BIB9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0304-3975(80)90061-4","article-title":"Selection and sorting with limited storage","volume":"12","author":"Munro","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(95)00225-1_BIB10","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1016\/0196-6774(92)90045-E","article-title":"Sorting with minimum data movement","volume":"13","author":"Munro","year":"1992","journal-title":"J. Algorithms"},{"key":"10.1016\/0304-3975(95)00225-1_BIB11","series-title":"Proc. 12th FST & TCS Conf.","first-page":"380","article-title":"Selection from read-only memory and sorting with optimum data movement","volume":"Vol. 652","author":"Munro","year":"1992"},{"key":"10.1016\/0304-3975(95)00225-1_BIB12","doi-asserted-by":"crossref","unstructured":"J.I. Munro and V. Raman, Fast stable in-place sorting with O(n) data moves, Algorithmica, to appear.","DOI":"10.1007\/3-540-54967-6_74"},{"key":"10.1016\/0304-3975(95)00225-1_BIB13","series-title":"Dept. of Computer Sci., Univ. Waterloo, CS-91-12","article-title":"Sorting in-place with minimum data movement","author":"Raman","year":"1991"},{"key":"10.1016\/0304-3975(95)00225-1_BIB14","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","article-title":"Finding the median","volume":"13","author":"Sch\u00f6nhage","year":"1976","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595002251?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595002251?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T00:56:06Z","timestamp":1555376166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595002251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0304397595002251"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00225-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}