{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:48:29Z","timestamp":1759063709193},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540605737"},{"type":"electronic","value":"9783540477662"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0015429","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T01:50:06Z","timestamp":1131846606000},"page":"244-253","source":"Crossref","is-referenced-by-count":5,"title":["Linear-time in-place selection in less than 3n comparisons"],"prefix":"10.1007","author":[{"given":"Svante","family":"Carlsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikael","family":"Sundstr\u00f6m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"S. W. Bent, J. W. John, Finding the median requires 2n comparisons, In Proceedings of the 17th Annual Symposium on Theory of Computing, pp. 213\u2013216, 1985.","DOI":"10.1145\/22145.22169"},{"key":"28_CR2","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:448\u2013461, 1973.","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR3","unstructured":"S. Carlsson and M. Sundstr\u00f6m, Linear-time In-place Selection in Less than 3n Comparisons, extended version available at \u2329URL:http:\/\/www. sm. luth. se\/\u223cmsm\/reports\/in-place.ps\u232a"},{"issue":"1","key":"28_CR4","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0020-0190(87)90033-0","volume":"26","author":"S. Carlsson","year":"1987","unstructured":"S. Carlsson, The Deap \u2014 A double-ended heap to implement double-ended priority queues, Information processing Letters 26 (1):33\u201336, 1987.","journal-title":"Information processing Letters"},{"key":"28_CR5","unstructured":"D. Dor and U. Zwick, Selecting the median, In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms (SODA'95), San Francisco, California, January 1995."},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"T. W. Lai and D. Wood, Implicit Selection, In SWAT 88, pp. 14\u201323, 1988.","DOI":"10.1007\/3-540-19487-8_2"},{"key":"28_CR7","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1016\/S0022-0000(76)80029-3","volume":"13","author":"A. Sch\u00f6nhage","year":"1976","unstructured":"A. Sch\u00f6nhage, M. Paterson, and N. Pippenger, Finding the median, Journal of Computer and System Sciences, 13:184\u2013199, 1976.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0015429","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T16:49:30Z","timestamp":1586537370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015429"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605737","9783540477662"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0015429","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}