{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:58Z","timestamp":1750307758258,"version":"3.41.0"},"reference-count":24,"publisher":"Association for Computing Machinery (ACM)","issue":"9","license":[{"start":{"date-parts":[[2008,9,1]],"date-time":"2008-09-01T00:00:00Z","timestamp":1220227200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2008,9]]},"abstract":"<jats:p>\n            In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter\n            <jats:italic>D<\/jats:italic>\n            consisting of\n            <jats:italic>n<\/jats:italic>\n            nodes in which each node holds a numeric element, the goal of a\n            <jats:italic>k<\/jats:italic>\n            -selection algorithm is to determine the\n            <jats:italic>k<\/jats:italic>\n            <jats:sup>\n              <jats:italic>th<\/jats:italic>\n            <\/jats:sup>\n            smallest of these elements. We prove that distributed selection indeed requires more work than other aggregation functions such as, e.g., the computation of the average or the maximum of all elements. On the other hand, we show that the\n            <jats:italic>k<\/jats:italic>\n            <jats:sup>\n              <jats:italic>th<\/jats:italic>\n            <\/jats:sup>\n            smallest element can be computed efficiently by providing both a randomized and a deterministic\n            <jats:italic>k<\/jats:italic>\n            -selection algorithm, dispelling the misconception that solving distributed selection through in-network aggregation is infeasible.\n          <\/jats:p>","DOI":"10.1145\/1378727.1378749","type":"journal-article","created":{"date-parts":[[2008,8,27]],"date-time":"2008-08-27T11:56:36Z","timestamp":1219838196000},"page":"93-99","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Distributed selection"],"prefix":"10.1145","volume":"51","author":[{"given":"Fabian","family":"Kuhn","sequence":"first","affiliation":[{"name":"Institute of Theoretical Computer Science, ETH Zurich, Switzerland"}]},{"given":"Thomas","family":"Locher","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2008,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(73)80033-9"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236360.1236417"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840361"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806718"},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Goel A. and Estrin D. Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk. Algorithmica 43(l-2):5--15 2005.  Goel A. and Estrin D. Simultaneous optimization for concave costs: Single sink aggregation or single source buy-at-bulk. Algorithmica 43(l-2):5--15 2005.","DOI":"10.1007\/s00453-005-1155-0"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060649"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946317"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060303"},{"volume-title":"Proceedings of the 23rd Allerton Conference on Communication, Control, and Computing","year":"1985","author":"Marberg J. M.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1236360.1236362"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.588617"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011809"},{"volume-title":"SIAM Monographs on Discrete Mathematics and Applications","year":"2000","author":"Peleg D.","key":"e_1_2_1_14_1"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(82)90045-9"},{"key":"e_1_2_1_16_1","first-page":"235","article-title":"Shout-echo selection in distributed files","volume":"16","author":"Rodem D.","year":"1986","journal-title":"Networks."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(88)90029-9"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90368-P"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80029-3"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806717"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/31846.32978"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804414"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/601858.601861"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/SNPA.2003.1203364"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378727.1378749","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1378727.1378749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:25Z","timestamp":1750253965000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378727.1378749"}},"subtitle":["a missing piece of data aggregation"],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":24,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["10.1145\/1378727.1378749"],"URL":"https:\/\/doi.org\/10.1145\/1378727.1378749","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"type":"print","value":"0001-0782"},{"type":"electronic","value":"1557-7317"}],"subject":[],"published":{"date-parts":[[2008,9]]},"assertion":[{"value":"2008-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}