{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:13Z","timestamp":1750307953452,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,14]],"date-time":"2008-06-14T00:00:00Z","timestamp":1213401600000},"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":[[2008,6,14]]},"DOI":"10.1145\/1378533.1378569","type":"proceedings-article","created":{"date-parts":[[2008,6,17]],"date-time":"2008-06-17T13:49:02Z","timestamp":1213710542000},"page":"188-190","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Energy-optimal distributed algorithms for minimum spanning trees"],"prefix":"10.1145","author":[{"given":"Yongwook","family":"Choi","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"given":"Maleq","family":"Khan","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}]},{"given":"V.S. Anil","family":"Kumar","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_92"},{"key":"e_1_3_2_1_2_1","unstructured":"Y. Choi M. Khan V.S.A. Kumar and G. Pandurangan. Energy-Efficient Distributed Minimum Spanning Tree Construction: Tight Bounds and Algorithms. available at http:\/\/www.cs.purdue.edu\/people\/gopal\/emst.pdf.  Y. Choi M. Khan V.S.A. Kumar and G. Pandurangan. Energy-Efficient Distributed Minimum Spanning Tree Construction: Tight Bounds and Algorithms. available at http:\/\/www.cs.purdue.edu\/people\/gopal\/emst.pdf."},{"key":"e_1_3_2_1_3_1","volume-title":"Introduction to Algorithms","author":"Cormen T.","year":"1990","unstructured":"T. Cormen , C. Leiserson , and R. Rivest . Introduction to Algorithms . The MIT Press , 1990 . T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. The MIT Press, 1990."},{"key":"e_1_3_2_1_4_1","volume-title":"SODA","author":"Elkin M.","year":"2004","unstructured":"M. Elkin . A faster distributed protocol for constructing minimum spanning tree . In SODA , 2004 . M. Elkin. A faster distributed protocol for constructing minimum spanning tree. In SODA, 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1998.760846"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2002.804190"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/850928.851836"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0047-8"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.57"},{"key":"e_1_3_2_1_11_1","volume-title":"SODA","author":"Muthukrishnan S.","year":"2005","unstructured":"S. Muthukrishnan and G. Pandurangan . The bin-covering technique for thresholding random geometric graph properties . In SODA , 2005 . S. Muthukrishnan and G. Pandurangan. The bin-covering technique for thresholding random geometric graph properties. In SODA, 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality Sensitive Approach","author":"Peleg D.","year":"2000","unstructured":"D. Peleg . Distributed Computing: A Locality Sensitive Approach . SIAM , 2000 . D. Peleg. Distributed Computing: A Locality Sensitive Approach. SIAM, 2000."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778580.1778602"}],"event":{"name":"SPAA08: 20th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Munich Germany","acronym":"SPAA08"},"container-title":["Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1378533.1378569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:53Z","timestamp":1750258673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,14]]},"references-count":13,"alternative-id":["10.1145\/1378533.1378569","10.1145\/1378533"],"URL":"https:\/\/doi.org\/10.1145\/1378533.1378569","relation":{},"subject":[],"published":{"date-parts":[[2008,6,14]]},"assertion":[{"value":"2008-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}