{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:13:22Z","timestamp":1772910802341,"version":"3.50.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,1,1]],"date-time":"1988-01-01T00:00:00Z","timestamp":567993600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T00:00:00Z","timestamp":1048636800000},"content-version":"vor","delay-in-days":5563,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1988,1]]},"DOI":"10.1016\/0020-0190(88)90186-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"295-299","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":66,"title":["An optimally efficient selection algorithm"],"prefix":"10.1016","volume":"26","author":[{"given":"Richard John","family":"Cole","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(88)90186-X_BIB1","first-page":"188","article-title":"Deterministic selection in O(log log n) parallel time","author":"Ajtai","year":"1986","journal-title":"18th Ann. ACM Symp. on the Theory of Computing"},{"issue":"2","key":"10.1016\/0020-0190(88)90186-X_BIB2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(88)90186-X_BIB3","first-page":"511","article-title":"Parallel merge sort","author":"Cole","year":"1986","journal-title":"27th Ann. IEEE Symp. on the Foundations of Computer Science"},{"key":"10.1016\/0020-0190(88)90186-X_BIB4","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/S0019-9958(86)80023-7","article-title":"Deterministic coin tossing with application to optimal list ranking","volume":"70","author":"Cole","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(88)90186-X_BIB5","first-page":"206","article-title":"Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms","author":"Cole","year":"1986","journal-title":"18th Ann. ACM Symp. on the Theory of Computing"},{"key":"10.1016\/0020-0190(88)90186-X_BIB6","series-title":"Tech. Rept. No. 277","article-title":"Faster Optimal Prefix Sums and List Ranking","author":"Cole","year":"1987"},{"issue":"3","key":"10.1016\/0020-0190(88)90186-X_BIB7","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0020-0190(85)90080-8","article-title":"A parallel median algorithm","volume":"20","author":"Cole","year":"1985","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(88)90186-X_BIB8","first-page":"212","article-title":"A fast probabilistic sorting algorithm","author":"Reischuk","year":"1981","journal-title":"Proc. 22nd Ann. Foundations of Computer Science Conf."},{"issue":"3","key":"10.1016\/0020-0190(88)90186-X_BIB9","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(88)90186-X_BIB10","author":"Vishkin","year":"1983","journal-title":"An optimal parallel algorithm for selection"},{"key":"10.1016\/0020-0190(88)90186-X_BIB11","series-title":"Tech. Rept. 71","article-title":"Synchronous Parallel Computation\u2014A Survey","author":"Vishkin","year":"1983"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908890186X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908890186X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:57Z","timestamp":1757084337000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908890186X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,1]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1988,1]]}},"alternative-id":["002001908890186X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(88)90186-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1988,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An optimally efficient selection algorithm","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(88)90186-X","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}