{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:38:38Z","timestamp":1773931118556,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DST\/SERB MATRICS","award":["MTR\/2018\/001198"],"award-info":[{"award-number":["MTR\/2018\/001198"]}]},{"name":"Centre of Excellence in Cryptography Cybersecurity and Distributed Trust under the IIT Madras Institute of Eminence Scheme"},{"name":"VAJRA visiting faculty program of the Government of India"},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1540512, IIS-1633720, CCF-1717075"],"award-info":[{"award-number":["CCF-1540512, IIS-1633720, CCF-1717075"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"U.S.-Israel Binational Science Foundation (BSF)","award":["2016419"],"award-info":[{"award-number":["2016419"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538459","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"51-53","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds"],"prefix":"10.1145","author":[{"given":"John","family":"Augustine","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Madras, Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"William K.","family":"Moses","sequence":"additional","affiliation":[{"name":"University of Houston, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gopal","family":"Pandurangan","sequence":"additional","affiliation":[{"name":"University of Houston, Houston, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11--15, 2005, Proceedings (Lecture Notes in Computer Science","volume":"1150","author":"Amb\u00fchl Christoph","year":"2005","unstructured":"Christoph Amb\u00fchl . 2005 . An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. In Automata, Languages and Programming , 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11--15, 2005, Proceedings (Lecture Notes in Computer Science , Vol. 3580). Springer, 1139-- 1150 . Christoph Amb\u00fchl. 2005. An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks. In Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11--15, 2005, Proceedings (Lecture Notes in Computer Science, Vol. 3580). Springer, 1139--1150."},{"key":"e_1_3_2_2_2_1","volume-title":"Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. arXiv preprint arXiv:2204.08385","author":"Augustine John","year":"2022","unstructured":"John Augustine , William K. Moses Jr ., and Gopal Pandurangan . 2022. Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. arXiv preprint arXiv:2204.08385 ( 2022 ). John Augustine, William K. Moses Jr., and Gopal Pandurangan. 2022. Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds. arXiv preprint arXiv:2204.08385 (2022)."},{"key":"e_1_3_2_2_3_1","volume-title":"35th International Symposium on Distributed Computing, DISC","author":"Barenboim Leonid","year":"2021","unstructured":"Leonid Barenboim and Tzalik Maimon . 2021. Deterministic Logarithmic Completeness in the Distributed Sleeping Model . In 35th International Symposium on Distributed Computing, DISC 2021 , October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs , Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz- Zentrum f\u00fcr Informatik, 10:1--10: 19 . https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2021.10 10.4230\/LIPIcs.DISC.2021.10 Leonid Barenboim and Tzalik Maimon. 2021. Deterministic Logarithmic Completeness in the Distributed Sleeping Model. In 35th International Symposium on Distributed Computing, DISC 2021, October 4--8, 2021, Freiburg, Germany (Virtual Conference) (LIPIcs, Vol. 209), Seth Gilbert (Ed.). Schloss Dagstuhl - Leibniz- Zentrum f\u00fcr Informatik, 10:1--10:19. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2021.10"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212774"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405718"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007407"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087823"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch16"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451081"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.57"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699440"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0929"},{"key":"e_1_3_2_2_15_1","unstructured":"Gopal Pandurangan. 2021. Distributed Network Algorithms. In Distributed Network Algorithms. https:\/\/sites.google.com\/site\/gopalpandurangan\/home\/distributed-network-algorithms  Gopal Pandurangan. 2021. Distributed Network Algorithms. In Distributed Network Algorithms. https:\/\/sites.google.com\/site\/gopalpandurangan\/home\/distributed-network-algorithms"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055449"},{"key":"e_1_3_2_2_17_1","volume-title":"The Distributed Minimum Spanning Tree Problem. Bull. EATCS 125","author":"Pandurangan Gopal","year":"2018","unstructured":"Gopal Pandurangan , Peter Robinson , and Michele Scquizzato . 2018. The Distributed Minimum Spanning Tree Problem. Bull. EATCS 125 ( 2018 ). Gopal Pandurangan, Peter Robinson, and Michele Scquizzato. 2018. The Distributed Minimum Spanning Tree Problem. Bull. EATCS 125 (2018)."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369740"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","location":"Salerno Italy","acronym":"PODC '22","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538459","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538459","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538459"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":19,"alternative-id":["10.1145\/3519270.3538459","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538459","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}