{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:33:08Z","timestamp":1757539988978},"reference-count":19,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7529,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1986,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>An algorithm for selecting the <jats:italic>k<\/jats:italic>th smallest element of a distributed file using shout\u2010echo communication primitives is presented. It is shown that, for large values of <jats:italic>k<\/jats:italic> (e. g., the median), the proposed algorithm improves the existing upperbound.<\/jats:p>","DOI":"10.1002\/net.3230160108","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T20:21:48Z","timestamp":1178914908000},"page":"77-86","source":"Crossref","is-referenced-by-count":15,"title":["Shout echo selection in distributed files"],"prefix":"10.1002","volume":"16","author":[{"given":"Doron","family":"Rotem","sequence":"first","affiliation":[]},{"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[]},{"given":"Jeffrey B.","family":"Sidney","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"M. F.Aburdenc Distributed algorithms for extrema\u2010finding in circular configurations of processes. Proc. IEEE Int. Symp. on Large Scale Systems (1982)269\u2013271."},{"key":"e_1_2_1_3_2","first-page":"91","volume-title":"A formal model for message passing systems. Tech. Rep","author":"Burns J.","year":"1980"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/359104.359108"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90023-2"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/358506.358517"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"G. N.Frederikson Tradeoffs for selection in distributed networks. Proc. 2nd Symp. on Principles of Distributed Computing (1983)154\u2013160.","DOI":"10.1145\/800221.806718"},{"key":"e_1_2_1_8_2","volume-title":"Finding a leader in a network with O(e) + O(n log \/n) messages","author":"Gallager R. G.","year":"1979"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/359024.359029"},{"key":"e_1_2_1_10_2","unstructured":"E.Korach D.Rotem andN.Santoro A probabilistic algorithm for extrema\u2010finding in a circle of processors. Tech. Rep. CS\u201081\u201019 Department of Computer Science University of Waterloo 1981."},{"key":"e_1_2_1_11_2","unstructured":"E.Korach D.Rotem andN.Santoro Distributed algorithms for ranking the nodes of a network. Proc. 13th SE Conf. on Combinatorics. Graph Theory and Computing.1982 235\u2013246."},{"key":"e_1_2_1_12_2","first-page":"155","article-title":"Distributed systems\u2013toward a formal approach","volume":"77","author":"LeLann G.","year":"1977","journal-title":"Proc. IFIP"},{"key":"e_1_2_1_13_2","doi-asserted-by":"crossref","unstructured":"J.Pachl E.Korach andD.Rotem A technique for proving lower bounds for distributed election algorithms. Proc. 14th ACM Symp. on Theory of Computing (1982)378\u2013382.","DOI":"10.1145\/800070.802213"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/69622.357194"},{"key":"e_1_2_1_15_2","doi-asserted-by":"crossref","unstructured":"M.Rodeh Finding the median distributively. J. Comp. System Sci. (1982)162\u2013166.","DOI":"10.1016\/0022-0000(82)90045-9"},{"key":"e_1_2_1_16_2","unstructured":"D.Rotem N.Santoro andJ. B.Sidney A shout\u2010echo algorithm for finding the median of a distributed set. Proc. 11th SE Conf. on Combinatories Graph Theory and Computing 1983 311\u2013318."},{"key":"e_1_2_1_17_2","unstructured":"N.Santoro E.Korach andD.Rotem Decentralized extrema\u2010finding in circular configurations of processors: An improved algorithm. Proc. 11th Conf. on Numerical Mathematics and Computing 1981 pp.401\u2013412."},{"key":"e_1_2_1_18_2","unstructured":"N.SantoroandJ. B.Sidney Order statistics on distributed sets. Proc. 20th Allerton Conf. on Communication Control and Computing 1982 251\u2013256."},{"key":"e_1_2_1_19_2","unstructured":"N.SantoroandJ. B.Sidney Communication bounds for selection distributed sets. Tech. Rep. SCS\u2010TR\u201010 Carleton University 1982."},{"key":"e_1_2_1_20_2","doi-asserted-by":"crossref","unstructured":"A. C.Yao Some complexity questions related to distributive computing. Proc. 11\u2010th ACM Symp. on Theory of Computing 1979 pp.209\u2013213.","DOI":"10.1145\/800135.804414"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230160108","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230160108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T01:50:55Z","timestamp":1697853055000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230160108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,3]]}},"alternative-id":["10.1002\/net.3230160108"],"URL":"https:\/\/doi.org\/10.1002\/net.3230160108","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,3]]}}}