{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:57Z","timestamp":1759639077815,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,1,5]],"date-time":"2021-01-05T00:00:00Z","timestamp":1609804800000},"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":[],"published-print":{"date-parts":[[2021,1,5]]},"DOI":"10.1145\/3427796.3427800","type":"proceedings-article","created":{"date-parts":[[2020,12,25]],"date-time":"2020-12-25T22:25:45Z","timestamp":1608935145000},"page":"36-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Communication Costs in a Geometric Communication Network"],"prefix":"10.1145","author":[{"given":"Sima","family":"Hajiaghaei Shanjani","sequence":"first","affiliation":[{"name":"University of Victoria, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valerie","family":"King","sequence":"additional","affiliation":[{"name":"University of Victoria, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,1,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Approximating extent measures of points. J. ACM","author":"Agarwal K.","year":"2004","unstructured":"Pankaj\u00a0 K. Agarwal , Sariel Har-Peled , and Kasturi\u00a0 R. Varadarajan . 2004. Approximating extent measures of points. J. ACM ( 2004 ), 606\u2013635. Pankaj\u00a0K. Agarwal, Sariel Har-Peled, and Kasturi\u00a0R. Varadarajan. 2004. Approximating extent measures of points. J. ACM (2004), 606\u2013635."},{"key":"e_1_3_2_1_2_1","unstructured":"Pankaj\u00a0K. Agarwal Sariel Har-Peled and Kasturi\u00a0R. Varadarajan. 2005. Geometric approximation via coresets. In COMBINATORIAL AND COMPUTATIONAL GEOMETRY MSRI. 1\u201330.  Pankaj\u00a0K. Agarwal Sariel Har-Peled and Kasturi\u00a0R. Varadarajan. 2005. Geometric approximation via coresets. In COMBINATORIAL AND COMPUTATIONAL GEOMETRY MSRI. 1\u201330."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Pankaj\u00a0K. Agarwal Jir\u00ed Matousek and Subhash Suri. 1991. Farthest Neighbors Maximum Spanning Trees and Related Problems in Higher Dimensions. Comput. Geom. (1991) 189\u2013201.  Pankaj\u00a0K. Agarwal Jir\u00ed Matousek and Subhash Suri. 1991. Farthest Neighbors Maximum Spanning Trees and Related Problems in Higher Dimensions. Comput. Geom. (1991) 189\u2013201.","DOI":"10.1016\/0925-7721(92)90001-9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2582112.2582161"},{"key":"e_1_3_2_1_5_1","volume-title":"A Trade-Off between Information and Communication in Broadcast Protocols. J. ACM","author":"Awerbuch Baruch","year":"1990","unstructured":"Baruch Awerbuch , Oded Goldreich , David Peleg , and Ronen Vainish . 1990. A Trade-Off between Information and Communication in Broadcast Protocols. J. ACM ( 1990 ), 238\u2013256. Baruch Awerbuch, Oded Goldreich, David Peleg, and Ronen Vainish. 1990. A Trade-Off between Information and Communication in Broadcast Protocols. J. ACM (1990), 238\u2013256."},{"key":"e_1_3_2_1_6_1","volume-title":"Approximate Convex Hull of Data Streams. In ICALP","author":"Blum Avrim","year":"2018","unstructured":"Avrim Blum , Vladimir Braverman , Ananya Kumar , Harry Lang , and Lin\u00a0 F. Yang . 2018 . Approximate Convex Hull of Data Streams. In ICALP 2018. 21:1\u201321:13. Avrim Blum, Vladimir Braverman, Ananya Kumar, Harry Lang, and Lin\u00a0F. Yang. 2018. Approximate Convex Hull of Data Streams. In ICALP 2018. 21:1\u201321:13."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Timothy\u00a0M. Chan. 2006. Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. (2006) 20\u201335.  Timothy\u00a0M. Chan. 2006. Faster core-set constructions and data-stream algorithms in fixed dimensions. Comput. Geom. (2006) 20\u201335.","DOI":"10.1016\/j.comgeo.2005.10.002"},{"key":"e_1_3_2_1_9_1","volume-title":"DISC","author":"Ghaffari Mohsen","year":"2018","unstructured":"Mohsen Ghaffari and Fabian Kuhn . 2018 . Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping . In DISC 2018. 30:1\u201330:12. Mohsen Ghaffari and Fabian Kuhn. 2018. Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping. In DISC 2018. 30:1\u201330:12."},{"key":"e_1_3_2_1_10_1","volume-title":"Time-Message Trade-Offs in Distributed Algorithms. In DISC","author":"Gmyr Robert","year":"2018","unstructured":"Robert Gmyr and Gopal Pandurangan . 2018 . Time-Message Trade-Offs in Distributed Algorithms. In DISC 2018. 1\u201318. Robert Gmyr and Gopal Pandurangan. 2018. Time-Message Trade-Offs in Distributed Algorithms. In DISC 2018. 1\u201318."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055595"},{"key":"e_1_3_2_1_12_1","volume-title":"Communication Complexity with Synchronized Clocks. In CCC","author":"Impagliazzo Russell","year":"2010","unstructured":"Russell Impagliazzo and Ryan Williams . 2010 . Communication Complexity with Synchronized Clocks. In CCC 2010. 259\u2013269. Russell Impagliazzo and Ryan Williams. 2010. Communication Complexity with Synchronized Clocks. In CCC 2010. 259\u2013269."},{"key":"e_1_3_2_1_13_1","series-title":"SIAM J. Discrete Math.(1992)","volume-title":"The probabilistic communication complexity of set intersection","author":"Kalyanasundaram Bala","unstructured":"Bala Kalyanasundaram and Georg Schintger . 1992. The probabilistic communication complexity of set intersection . SIAM J. Discrete Math.(1992) . Bala Kalyanasundaram and Georg Schintger. 1992. The probabilistic communication complexity of set intersection. SIAM J. Discrete Math.(1992)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767405"},{"volume-title":"Communication complexity","author":"Kushilevitz Eyal","key":"e_1_3_2_1_15_1","unstructured":"Eyal Kushilevitz and Noam Nisan . 1997. Communication complexity . Cambridge University Press . Eyal Kushilevitz and Noam Nisan. 1997. Communication complexity. Cambridge University Press."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484274"},{"key":"e_1_3_2_1_17_1","volume-title":"On the Complexity of Universal Leader Election. J. ACM","author":"Kutten Shay","year":"2015","unstructured":"Shay Kutten , Gopal Pandurangan , David Peleg , Peter Robinson , and Amitabh Trehan . 2015. On the Complexity of Universal Leader Election. J. ACM ( 2015 ), 7:1\u20137:27. Shay Kutten, Gopal Pandurangan, David Peleg, Peter Robinson, and Amitabh Trehan. 2015. On the Complexity of Universal Leader Election. J. ACM (2015), 7:1\u20137:27."},{"key":"e_1_3_2_1_18_1","volume-title":"DISC","author":"Mashreghi Ali","year":"2018","unstructured":"Ali Mashreghi and Valerie King . 2018 . Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model . In DISC 2018. 37:1\u201337:17. Ali Mashreghi and Valerie King. 2018. Broadcast and Minimum Spanning Tree with o(m) Messages in the Asynchronous CONGEST Model. In DISC 2018. 37:1\u201337:17."},{"key":"e_1_3_2_1_19_1","first-page":"1","article-title":"Brief Announcement","volume":"2019","author":"Mashreghi Ali","year":"2019","unstructured":"Ali Mashreghi and Valerie King . 2019 . Brief Announcement : Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication. In DISC 2019. 49: 1 \u2013 49 :3. Ali Mashreghi and Valerie King. 2019. Brief Announcement: Faster Asynchronous MST and Low Diameter Tree Construction with Sublinear Communication. In DISC 2019. 49:1\u201349:3.","journal-title":"In DISC"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Sergio Rajsbaum and Jorge Urrutia. 2011. Some problems in distributed computational geometry. Theor. Comput. Sci. (2011) 5760\u20135770.  Sergio Rajsbaum and Jorge Urrutia. 2011. Some problems in distributed computational geometry. Theor. Comput. Sci. (2011) 5760\u20135770.","DOI":"10.1016\/j.tcs.2011.06.035"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"A.A. Razborov. 1992. On the distributional complexity of disjointness. Theoretical Computer Science(1992) 385 \u2013 390.  A.A. Razborov. 1992. On the distributional complexity of disjointness. Theoretical Computer Science(1992) 385 \u2013 390.","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Peter Robinson. 2020. Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners.  Peter Robinson. 2020. Being Fast Means Being Chatty: The Local Information Cost of Graph Spanners.","DOI":"10.1137\/1.9781611976465.126"},{"key":"e_1_3_2_1_25_1","volume-title":"STOC","author":"Sarma Atish\u00a0Das","year":"2011","unstructured":"Atish\u00a0Das Sarma , Stephan Holzer , Liah Kor , Amos Korman , Danupon Nanongkai , Gopal Pandurangan , David Peleg , and Roger Wattenhofer . 2011 . Distributed verification and hardness of distributed approximation . In STOC 2011. 363\u2013372. Atish\u00a0Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. 2011. Distributed verification and hardness of distributed approximation. In STOC 2011. 363\u2013372."},{"key":"e_1_3_2_1_26_1","series-title":"SIAM J. Comput. (2012), 1235\u20131265","volume-title":"Distributed Verification and Hardness of Distributed Approximation","author":"Sarma Atish\u00a0Das","unstructured":"Atish\u00a0Das Sarma , Stephan Holzer , Liah Kor , Amos Korman , Danupon Nanongkai , Gopal Pandurangan , David Peleg , and Roger Wattenhofer . 2012. Distributed Verification and Hardness of Distributed Approximation . SIAM J. Comput. (2012), 1235\u20131265 . Atish\u00a0Das Sarma, Stephan Holzer, Liah Kor, Amos Korman, Danupon Nanongkai, Gopal Pandurangan, David Peleg, and Roger Wattenhofer. 2012. Distributed Verification and Hardness of Distributed Approximation. SIAM J. Comput. (2012), 1235\u20131265."}],"event":{"name":"ICDCN '21: International Conference on Distributed Computing and Networking 2021","acronym":"ICDCN '21","location":"Nara Japan"},"container-title":["Proceedings of the 22nd International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427796.3427800","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3427796.3427800","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:31Z","timestamp":1750197751000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3427796.3427800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,5]]},"references-count":24,"alternative-id":["10.1145\/3427796.3427800","10.1145\/3427796"],"URL":"https:\/\/doi.org\/10.1145\/3427796.3427800","relation":{},"subject":[],"published":{"date-parts":[[2021,1,5]]},"assertion":[{"value":"2021-01-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}