{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T05:11:17Z","timestamp":1767676277959,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T00:00:00Z","timestamp":1437436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1318166"],"award-info":[{"award-number":["CCF-1318166"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"US-Israel Binational Science Foundation","award":["2008348"],"award-info":[{"award-number":["2008348"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,21]]},"DOI":"10.1145\/2767386.2767434","type":"proceedings-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T13:28:49Z","timestamp":1437139729000},"page":"91-100","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":65,"title":["Toward Optimal Bounds in the Congested Clique"],"prefix":"10.1145","author":[{"given":"James W.","family":"Hegeman","sequence":"first","affiliation":[{"name":"The University of Iowa, Iowa City, USA"}]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[{"name":"University of Houston, Houston, USA"}]},{"given":"Sriram V.","family":"Pemmaraju","sequence":"additional","affiliation":[{"name":"The University of Iowa, Iowa City, USA"}]},{"given":"Vivek B.","family":"Sardeshmukh","sequence":"additional","affiliation":[{"name":"The University of Iowa, Iowa City, USA"}]},{"given":"Michele","family":"Scquizzato","sequence":"additional","affiliation":[{"name":"University of Houston, Houston, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/277651.277662"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095156"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213556.2213560"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095205"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77618"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31585-5_39"},{"key":"e_1_3_2_1_7_1","volume-title":"Algebraic methods in the congested clique. arXiv preprint, arXiv:1503.04963","author":"Censor-Hillel K.","year":"2015","unstructured":"K. Censor-Hillel , P. Kaski , J. H. Korhonen , C. Lenzen , A. Paz , and J. Suomela . Algebraic methods in the congested clique. arXiv preprint, arXiv:1503.04963 , 2015 . K. Censor-Hillel, P. Kaski, J. H. Korhonen, C. Lenzen, A. Paz, and J. Suomela. Algebraic methods in the congested clique. arXiv preprint, arXiv:1503.04963, 2015."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-013-7131-9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_14"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332443"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148152"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09620-9_13"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_35"},{"key":"e_1_3_2_1_15_1","volume-title":"Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. arXiv preprint, arXiv:1412.3445","author":"Holzer S.","year":"2014","unstructured":"S. Holzer and N. Pinsker . Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. arXiv preprint, arXiv:1412.3445 , 2014 . S. Holzer and N. Pinsker. Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. arXiv preprint, arXiv:1412.3445, 2014."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989284.1989289"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627898"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/201019.201022"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2722129.2722157"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0216019"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704441848"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2627692.2627694"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_1_26_1","volume-title":"Almost optimal distributed algorithms for large-scale graph problems. arXiv preprint, arXiv:1503.02353","author":"Pandurangan G.","year":"2015","unstructured":"G. Pandurangan , P. Robinson , and M. Scquizzato . Almost optimal distributed algorithms for large-scale graph problems. arXiv preprint, arXiv:1503.02353 , 2015 . G. Pandurangan, P. Robinson, and M. Scquizzato. Almost optimal distributed algorithms for large-scale graph problems. arXiv preprint, arXiv:1503.02353, 2015."},{"key":"e_1_3_2_1_27_1","volume-title":"Manuscript","author":"Pandurangan G.","year":"2015","unstructured":"G. Pandurangan and M. Scquizzato . Message lower bounds in synchronous distributed models via communication complexity . Manuscript , 2015 . G. Pandurangan and M. Scquizzato. Message lower bounds in synchronous distributed models via communication complexity. Manuscript, 2015."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993851"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_30_1","unstructured":"D. P. Woodruff and Q. Zhang. When distributed computation is communication expensive. Distrib. Comput. to appear.  D. P. Woodruff and Q. Zhang. When distributed computation is communication expensive. Distrib. Comput. to appear."}],"event":{"name":"PODC '15: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Donostia-San Sebasti\u00e1n Spain","acronym":"PODC '15"},"container-title":["Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767434","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2767386.2767434","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:06Z","timestamp":1750223226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767434"}},"subtitle":["Graph Connectivity and MST"],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":30,"alternative-id":["10.1145\/2767386.2767434","10.1145\/2767386"],"URL":"https:\/\/doi.org\/10.1145\/2767386.2767434","relation":{},"subject":[],"published":{"date-parts":[[2015,7,21]]},"assertion":[{"value":"2015-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}