{"id":"https://openalex.org/W4286501311","doi":"https://doi.org/10.1145/3519270.3538459","title":"Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds","display_name":"Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds","publication_year":2022,"publication_date":"2022-07-20","ids":{"openalex":"https://openalex.org/W4286501311","doi":"https://doi.org/10.1145/3519270.3538459"},"language":"en","primary_location":{"id":"doi:10.1145/3519270.3538459","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1134929","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5016331110","display_name":"John Augustine","orcid":"https://orcid.org/0000-0003-0948-3961"},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"John Augustine","raw_affiliation_strings":["Indian Institute of Technology Madras, Chennai, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai, India","institution_ids":["https://openalex.org/I24676775"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070835473","display_name":"William K. Moses","orcid":"https://orcid.org/0000-0002-4533-7593"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William K. Moses","raw_affiliation_strings":["University of Houston, Houston, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089574654","display_name":"Gopal Pandurangan","orcid":"https://orcid.org/0000-0001-5833-6592"},"institutions":[{"id":"https://openalex.org/I44461941","display_name":"University of Houston","ror":"https://ror.org/048sx0r50","country_code":"US","type":"education","lineage":["https://openalex.org/I44461941"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gopal Pandurangan","raw_affiliation_strings":["University of Houston, Houston, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Houston, Houston, TX, USA","institution_ids":["https://openalex.org/I44461941"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0045,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.7835687,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"51","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.7478710412979126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7187519073486328},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7105928063392639},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6982179284095764},{"id":"https://openalex.org/keywords/wireless-sensor-network","display_name":"Wireless sensor network","score":0.6312497854232788},{"id":"https://openalex.org/keywords/wireless-ad-hoc-network","display_name":"Wireless ad hoc network","score":0.629717230796814},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6099047064781189},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5848513245582581},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5804210305213928},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4890161454677582},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4686894714832306},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4560946226119995},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.45213595032691956},{"id":"https://openalex.org/keywords/connected-dominating-set","display_name":"Connected dominating set","score":0.4506353735923767},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39446040987968445},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.38618388772010803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20782828330993652},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.18129748106002808},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.15091827511787415},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13404017686843872},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07337775826454163}],"concepts":[{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.7478710412979126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7187519073486328},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7105928063392639},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6982179284095764},{"id":"https://openalex.org/C24590314","wikidata":"https://www.wikidata.org/wiki/Q336038","display_name":"Wireless sensor network","level":2,"score":0.6312497854232788},{"id":"https://openalex.org/C94523657","wikidata":"https://www.wikidata.org/wiki/Q4085781","display_name":"Wireless ad hoc network","level":3,"score":0.629717230796814},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6099047064781189},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5848513245582581},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5804210305213928},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4890161454677582},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4686894714832306},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4560946226119995},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.45213595032691956},{"id":"https://openalex.org/C37810922","wikidata":"https://www.wikidata.org/wiki/Q5161409","display_name":"Connected dominating set","level":3,"score":0.4506353735923767},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39446040987968445},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.38618388772010803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20782828330993652},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.18129748106002808},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.15091827511787415},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13404017686843872},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07337775826454163},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3519270.3538459","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538459","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:durham-repository.worktribe.com:1134929","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1134929","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1134929","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1134929","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Presentation / Conference Contribution"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G5514198281","display_name":null,"funder_award_id":"CCF-1540512, IIS-1633720, CCF-1717075","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1534484868","https://openalex.org/W2015819397","https://openalex.org/W2042437235","https://openalex.org/W2077371116","https://openalex.org/W2083323175","https://openalex.org/W2104142168","https://openalex.org/W2172178473","https://openalex.org/W2186715137","https://openalex.org/W2592535728","https://openalex.org/W2963420932","https://openalex.org/W2963550269","https://openalex.org/W3046807936","https://openalex.org/W3170201847","https://openalex.org/W4205300528","https://openalex.org/W4254419859","https://openalex.org/W6947933094"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2376814941","https://openalex.org/W2387385213","https://openalex.org/W2390742649","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W2562218965","https://openalex.org/W2138987445","https://openalex.org/W620960161"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,28,35,41,48],"distributed":[3,13,19],"minimum":[4],"spanning":[5],"tree":[6],"(MST)":[7],"problem,":[8],"a":[9],"fundamental":[10],"problem":[11],"in":[12,24,27,58],"computing.":[14],"It":[15],"is":[16,34,40,46],"well-known":[17],"that":[18],"MST":[20],"can":[21,74],"be":[22],"solved":[23],"\u00d5(D+\u221an)":[25],"rounds":[26],"standard":[29],"CONGEST":[30],"model":[31],"(where":[32],"n":[33],"network":[36,42],"size":[37],"and":[38,44,66],"D":[39],"diameter)":[43],"this":[45],"essentially":[47],"best":[49],"possible":[50],"round":[51],"complexity":[52],"(up":[53],"to":[54,76],"logarithmic":[55],"factors).":[56],"However,":[57],"resource-constrained":[59],"networks":[60],"such":[61,81],"as":[62,82],"wireless":[63],"ad":[64],"hoc":[65],"sensor":[67],"networks,":[68],"nodes":[69],"spending":[70,78],"so":[71],"much":[72],"time":[73],"lead":[75],"significant":[77],"of":[79],"resources":[80],"energy.":[83]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}