{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:32Z","timestamp":1761611072507},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1016\/0020-0190(95)00150-b","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"123-129","source":"Crossref","is-referenced-by-count":29,"title":["Multiple Quickselect \u2014 Hoare's Find algorithm for several elements"],"prefix":"10.1016","volume":"56","author":[{"given":"Helmut","family":"Prodinger","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(95)00150-B_BIB1","series-title":"Concrete Mathematics","author":"Graham","year":"1989"},{"key":"10.1016\/0020-0190(95)00150-B_BIB2","series-title":"Mathematics for the Analysis of Algorithms","author":"Greene","year":"1981"},{"key":"10.1016\/0020-0190(95)00150-B_BIB3","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1145\/366622.366647","article-title":"Find (Algorithm 65)","volume":"4","author":"Hoare","year":"1961","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(95)00150-B_BIB4","series-title":"Analysis of Hoare's Find algorithm with median-of-three partition","author":"Kirschenhofer","year":"1995"},{"key":"10.1016\/0020-0190(95)00150-B_BIB5","series-title":"Proc. 1971 IFIP Congress","first-page":"19","article-title":"Mathematical analysis of algorithms","author":"Knuth","year":"1971"},{"key":"10.1016\/0020-0190(95)00150-B_BIB6","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(95)00150-B_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0167-7152(95)00139-5","article-title":"Average-case analysis of multiple Quickselect: An algorithm for finding order statistics","author":"Lent","year":"1996","journal-title":"Statist. Probab. Lett."},{"key":"10.1016\/0020-0190(95)00150-B_BIB8","doi-asserted-by":"crossref","DOI":"10.1051\/ita\/1995290402551","article-title":"Analysis of Quickselect: An algorithm for order statistics RAIRO","author":"Mahmoud","year":"1995","journal-title":"Theoret. Inform. Appl."},{"key":"10.1016\/0020-0190(95)00150-B_BIB9","series-title":"Approximation Theories of Mathematical Statistics","author":"Serfling","year":"1980"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500150B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909500150B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T05:58:34Z","timestamp":1620971914000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909500150B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["002001909500150B"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(95)00150-b","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}