{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T07:59:24Z","timestamp":1696924764313},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"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":7716,"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":[[1992,6]]},"DOI":"10.1016\/0304-3975(92)90368-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"185-204","source":"Crossref","is-referenced-by-count":14,"title":["A distributed selection algorithm and its expected communication complexity"],"prefix":"10.1016","volume":"100","author":[{"given":"Nicola","family":"Santoro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey B.","family":"Sidney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stuart J.","family":"Sidney","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0304-3975(92)90368-P_BIB1","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1145\/322186.322200","article-title":"Lower bounds on information transfer in distributed systems","volume":"27","author":"Abelson","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(92)90368-P_BIB2","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0304-3975(92)90368-P_BIB3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01840361","article-title":"An improved algorithm for finding the median distributively","volume":"2","author":"Chin","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0304-3975(92)90368-P_BIB4","first-page":"154","article-title":"Tradeoffs for selection in distributed networks","author":"Frederickson","year":"1983","journal-title":"Proc. 2nd ACM Symp. on Principles of Distributed Computing"},{"issue":"2","key":"10.1016\/0304-3975(92)90368-P_BIB5","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0022-0000(82)90048-4","article-title":"The complexity of selection and ranking in X+Y and matrices with sorted columns","volume":"24","author":"Frederickson","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(92)90368-P_BIB6","first-page":"235","article-title":"Distributed algorithms for ranking the nodes of a network","author":"Korach","year":"1982","journal-title":"Proc. 13th SE Conf. on Combinatorics, Graph Theory and Computing"},{"key":"10.1016\/0304-3975(92)90368-P_BIB7","first-page":"283","article-title":"An optimal shout-echo algorithm for selection in distributed sets","author":"Marberg","year":"1985","journal-title":"Proc. 23rd Allerton Conf. on Communication, Control and Computing"},{"key":"10.1016\/0304-3975(92)90368-P_BIB8","series-title":"Masters Thesis","article-title":"Distributed algorithms for selection","author":"Matsushita","year":"1983"},{"issue":"2","key":"10.1016\/0304-3975(92)90368-P_BIB9","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0022-0000(82)90045-9","article-title":"Finding the median distributively","volume":"24","author":"Rodeh","year":"1982","journal-title":"J. Comput. Systems Sci."},{"issue":"4","key":"10.1016\/0304-3975(92)90368-P_BIB10","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/TC.1985.5009389","article-title":"Distributed sorting","volume":"C-34","author":"Rotem","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(92)90368-P_BIB11","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\/0304-3975(92)90368-P_BIB12","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1016\/0743-7315(88)90029-9","article-title":"On the expected complexity of distributed selection","volume":"5","author":"Santoro","year":"1988","journal-title":"J. Parallel and Distributed Computing"},{"key":"10.1016\/0304-3975(92)90368-P_BIB13","first-page":"251","article-title":"Order statistics on distributed sets","author":"Santoro","year":"1982","journal-title":"Proc. 20th Allerton Conf. on Communication, Control and Computing"},{"key":"10.1016\/0304-3975(92)90368-P_BIB14","first-page":"456","article-title":"On the expected communication complexity of distributed selection","author":"Santoro","year":"1987","journal-title":"Proc. 4th Symp. on Theoretical Aspects of Computer Science"},{"issue":"6","key":"10.1016\/0304-3975(92)90368-P_BIB15","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1109\/12.24301","article-title":"Reduction techniques for selection in distributed files","volume":"38","author":"Santoro","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(92)90368-P_BIB16","first-page":"143","article-title":"Distributed k-selection: from a sequential to a distributed algorithm","author":"Shrira","year":"1983","journal-title":"Proc. 2nd ACM Symp. on Principles of Distributed Computing"},{"key":"10.1016\/0304-3975(92)90368-P_BIB17","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979","journal-title":"Proc. 11th ACM Symp. on Theory of Computing"},{"issue":"4","key":"10.1016\/0304-3975(92)90368-P_BIB18","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":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290368P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439759290368P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:58:39Z","timestamp":1555127919000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439759290368P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["030439759290368P"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(92)90368-p","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}