{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:46Z","timestamp":1757629546701,"version":"3.44.0"},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1988,4,1]],"date-time":"1988-04-01T00:00:00Z","timestamp":575856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1988,4,1]],"date-time":"1988-04-01T00:00:00Z","timestamp":575856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1988,4]]},"DOI":"10.1016\/0743-7315(88)90029-9","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"194-203","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["On the expected complexity of distributed selection"],"prefix":"10.1016","volume":"5","author":[{"given":"Nicola","family":"Santoro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Scheutzow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey B.","family":"Sidney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0743-7315(88)90029-9_BIB1"},{"key":"10.1016\/0743-7315(88)90029-9_BIB2","series-title":"Proc. 5th IEEE Conf on Distributed Computing Systems","article-title":"A near-optimal algorithm for finding the median distributively","author":"Chin","year":"1985"},{"key":"10.1016\/0743-7315(88)90029-9_BIB3","series-title":"Proc. 2nd ACM Symp. on Principles of Distributed Computing","first-page":"154","article-title":"Tradeoffs for selection in distributed networks","author":"Frederickson","year":"1983"},{"key":"10.1016\/0743-7315(88)90029-9_BIB4","series-title":"Proc. 13th SE Conf. on Combinatorics, Graph Theory and Computing","first-page":"235","article-title":"Distributed algorithms for ranking the nodes of a network","author":"Korach","year":"1982"},{"key":"10.1016\/0743-7315(88)90029-9_BIB5","series-title":"Proc. 23rd Allerton Conf. on Communication, Control and Computing","article-title":"An optimal shout-echo algorithm for selection in distributed sets","author":"Marberg","year":"1985"},{"article-title":"Distributed algorithms for selection","year":"1983","author":"Matsushita","key":"10.1016\/0743-7315(88)90029-9_BIB6"},{"issue":"2","key":"10.1016\/0743-7315(88)90029-9_BIB7","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0022-0000(82)90045-9","article-title":"Finding the median distributively","volume":"24","author":"Rodeb","year":"1982","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/0743-7315(88)90029-9_BIB8","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/TC.1985.5009389","article-title":"Distributed sorting","volume":"C-34","author":"Rotem","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(88)90029-9_BIB9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/net.3230160108","article-title":"Shout-echo selection in distributed files","volume":"16","author":"Rotem","year":"1986","journal-title":"Networks"},{"key":"10.1016\/0743-7315(88)90029-9_BIB10","series-title":"Proc. 20th Allerton Conf on Communication, Control and Computing","first-page":"251","article-title":"Order statistics on distributed sets","author":"Santoro","year":"1982"},{"key":"10.1016\/0743-7315(88)90029-9_BIB11_1","series-title":"Proc. 4th Symp. on Theoretical Aspects of Computer Science","article-title":"On the expected complexity of distributed selection","author":"Santoro","year":"1987"},{"key":"10.1016\/0743-7315(88)90029-9_BIB11_2","first-page":"456","article-title":"Reduction techniques for selection in distributed files","volume":"Vol. 247","author":"Santoro","year":"1987"},{"key":"10.1016\/0743-7315(88)90029-9_BIB12","series-title":"Proc. 2nd ACM Symp. on Principles of Distributed Computing","first-page":"143","article-title":"Distributed k-selection: From a sequential to a distributed algorithm","author":"Shrira","year":"1983"},{"issue":"4","key":"10.1016\/0743-7315(88)90029-9_BIB13","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1109\/TC.1985.5009390","article-title":"Optimal distributed algorithms for sorting and ranking","volume":"C-34","author":"Zaks","year":"1985","journal-title":"IEEE Trans. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731588900299?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0743731588900299?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:29:26Z","timestamp":1757514566000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0743731588900299"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["0743731588900299"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(88)90029-9","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1988,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the expected complexity of distributed selection","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(88)90029-9","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 Inc.","name":"copyright","label":"Copyright"}]}}