{"id":"https://openalex.org/W2592535728","doi":"https://doi.org/10.1145/3087801.3087823","title":"A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities","display_name":"A Simple Deterministic Distributed MST Algorithm, with Near-Optimal Time and Message Complexities","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2592535728","doi":"https://doi.org/10.1145/3087801.3087823","mag":"2592535728"},"language":"en","primary_location":{"id":"doi:10.1145/3087801.3087823","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075683085","display_name":"Michael Elkin","orcid":"https://orcid.org/0000-0003-4257-2122"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Michael Elkin","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5075683085"],"corresponding_institution_ids":["https://openalex.org/I124227911"],"apc_list":null,"apc_paid":null,"fwci":4.3151,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.95070134,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"157","last_page":"163"},"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.9994999766349792,"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.9994999766349792,"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.998199999332428,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9977999925613403,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.626552939414978},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5871977806091309},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5803513526916504},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5648088455200195},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5082654356956482},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5059482455253601},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4960375726222992},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.49390894174575806},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.468833863735199},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.466880738735199},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.46447813510894775},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.45935890078544617},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45852130651474},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4429527521133423},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.41791072487831116},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3438115119934082},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3186371326446533},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3045579493045807},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.15598231554031372}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.626552939414978},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5871977806091309},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5803513526916504},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5648088455200195},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5082654356956482},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5059482455253601},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4960375726222992},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.49390894174575806},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.468833863735199},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.466880738735199},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.46447813510894775},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.45935890078544617},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45852130651474},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4429527521133423},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41791072487831116},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3438115119934082},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3186371326446533},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3045579493045807},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.15598231554031372},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3087801.3087823","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087823","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W260270821","https://openalex.org/W1531368347","https://openalex.org/W1534484868","https://openalex.org/W1568961751","https://openalex.org/W1945440063","https://openalex.org/W1976485065","https://openalex.org/W1982792741","https://openalex.org/W1987099434","https://openalex.org/W1991541026","https://openalex.org/W1992996565","https://openalex.org/W2000695296","https://openalex.org/W2032607682","https://openalex.org/W2053981136","https://openalex.org/W2057792779","https://openalex.org/W2058191123","https://openalex.org/W2067661972","https://openalex.org/W2077371116","https://openalex.org/W2083323175","https://openalex.org/W2099556589","https://openalex.org/W2100466311","https://openalex.org/W2101014999","https://openalex.org/W2108000791","https://openalex.org/W2149100736","https://openalex.org/W2163097371","https://openalex.org/W2172178473","https://openalex.org/W2243432867","https://openalex.org/W2294674552","https://openalex.org/W2484918492","https://openalex.org/W2488670996","https://openalex.org/W2569211293","https://openalex.org/W2963420932","https://openalex.org/W3104014862","https://openalex.org/W4205300528","https://openalex.org/W4254419859"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W2381121915","https://openalex.org/W2099915933","https://openalex.org/W2390742649","https://openalex.org/W2387385213","https://openalex.org/W1703428550","https://openalex.org/W3116169590","https://openalex.org/W8653221","https://openalex.org/W4297934114"],"abstract_inverted_index":{"Distributed":[0],"minimum":[1],"spanning":[2],"tree":[3],"(MST)":[4],"problem":[5],"is":[6,37,67],"one":[7,73],"of":[8,40,62,65],"the":[9,38,41,59,63],"most":[10],"central":[11],"and":[12,20,46,54,70],"fundamental":[13],"problems":[14],"in":[15],"distributed":[16],"graph":[17],"algorithms.":[18],"Kutten":[19],"Peleg":[21,53],"[KP98]":[22,66],"devised":[23],"an":[24],"algorithm":[25,64],"with":[26,47,80],"running":[27,60,77],"time":[28,61,78],"O(D":[29],"+":[30,51],"\u221an":[31],".":[32],"log*":[33],"n),":[34],"where":[35],"D":[36],"hop-diameter":[39],"input":[42],"n-vertex":[43],"m-edge":[44],"graph,":[45],"message":[48,82],"complexity":[49],"O(m":[50],"n3/2).":[52],"Rubinovich":[55],"[PR99]":[56],"showed":[57],"that":[58],"essentially":[68],"tight,":[69],"asked":[71],"if":[72],"can":[74],"achieve":[75],"near-optimal":[76,81],"together":[79],"complexity.":[83]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":6},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}