{"id":"https://openalex.org/W2488670996","doi":"https://doi.org/10.1145/2933057.2933103","title":"MST in Log-Star Rounds of Congested Clique","display_name":"MST in Log-Star Rounds of Congested Clique","publication_year":2016,"publication_date":"2016-07-25","ids":{"openalex":"https://openalex.org/W2488670996","doi":"https://doi.org/10.1145/2933057.2933103","mag":"2488670996"},"language":"en","primary_location":{"id":"doi:10.1145/2933057.2933103","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2933057.2933103","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2933103&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=2933103&type=pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["CSAIL, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"CSAIL, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022875077","display_name":"Merav Parter","orcid":"https://orcid.org/0000-0002-2357-2445"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Merav Parter","raw_affiliation_strings":["CSAIL, Massachusetts Institute of Technology, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"CSAIL, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":11.5005,"has_fulltext":true,"cited_by_count":65,"citation_normalized_percentile":{"value":0.9856573,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"19","last_page":"28"},"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/T11478","display_name":"Caching and Content Delivery","score":0.9973999857902527,"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.9972000122070312,"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/binary-logarithm","display_name":"Binary logarithm","score":0.7735060453414917},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.7360929846763611},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6855908632278442},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5775681734085083},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.4760993719100952},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4516427516937256},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4429600238800049},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4420681297779083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4365188181400299},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42787569761276245},{"id":"https://openalex.org/keywords/star","display_name":"Star (game theory)","score":0.41800931096076965}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.7735060453414917},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.7360929846763611},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6855908632278442},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5775681734085083},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.4760993719100952},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4516427516937256},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4429600238800049},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4420681297779083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4365188181400299},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42787569761276245},{"id":"https://openalex.org/C2780897414","wikidata":"https://www.wikidata.org/wiki/Q7600592","display_name":"Star (game theory)","level":2,"score":0.41800931096076965},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2933057.2933103","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2933057.2933103","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2933103&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2933057.2933103","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2933057.2933103","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2933103&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[{"score":0.7300000190734863,"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15"}],"awards":[{"id":"https://openalex.org/G1523888516","display_name":null,"funder_award_id":"FA9550-","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G1739869781","display_name":null,"funder_award_id":"CCF-0939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2568697414","display_name":null,"funder_award_id":"CCF-0939370","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G4246297169","display_name":null,"funder_award_id":"CCF-093937","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4377892860","display_name":null,"funder_award_id":"FA9550-13-1-0042","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G4520951138","display_name":"AF: Small: Bounded-Contention Coding for Wireless Networks","funder_award_id":"1217506","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5211763862","display_name":null,"funder_award_id":"NSF CCF-1461559","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5323218611","display_name":null,"funder_award_id":"CCF-1217506","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5706445503","display_name":null,"funder_award_id":"CCF-1461559,CCF-1217506","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5809100787","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G5932407296","display_name":"AF: Medium: Distributed Algorithms for Resource-Constrained and Dynamic Settings","funder_award_id":"1461559","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6244900323","display_name":null,"funder_award_id":"0939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6565510919","display_name":null,"funder_award_id":"CCF-1217506","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G7034605617","display_name":null,"funder_award_id":"CCF-1217506, CCF-0939370","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8054742292","display_name":null,"funder_award_id":"CCF-1461559","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"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2488670996.pdf","grobid_xml":"https://content.openalex.org/works/W2488670996.grobid-xml"},"referenced_works_count":32,"referenced_works":["https://openalex.org/W1568961751","https://openalex.org/W1592346261","https://openalex.org/W1666479227","https://openalex.org/W1816797629","https://openalex.org/W1845051857","https://openalex.org/W1863846876","https://openalex.org/W1866858131","https://openalex.org/W1945584931","https://openalex.org/W1985361054","https://openalex.org/W1992996565","https://openalex.org/W2019807548","https://openalex.org/W2030825457","https://openalex.org/W2040011014","https://openalex.org/W2051586153","https://openalex.org/W2054910423","https://openalex.org/W2056695987","https://openalex.org/W2071346873","https://openalex.org/W2082738784","https://openalex.org/W2083323175","https://openalex.org/W2107008873","https://openalex.org/W2107805020","https://openalex.org/W2138304862","https://openalex.org/W2139535340","https://openalex.org/W2163841653","https://openalex.org/W2173213060","https://openalex.org/W2174199856","https://openalex.org/W2313024697","https://openalex.org/W2344116943","https://openalex.org/W2395489635","https://openalex.org/W2739466586","https://openalex.org/W2950813619","https://openalex.org/W4210896998"],"related_works":["https://openalex.org/W2011106535","https://openalex.org/W1541068124","https://openalex.org/W1994598067","https://openalex.org/W2036758175","https://openalex.org/W2007715402","https://openalex.org/W1525123833","https://openalex.org/W2475816962","https://openalex.org/W2004524662","https://openalex.org/W2962985337","https://openalex.org/W2899261484"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,7,33,73,80,85,93],"randomized":[3],"algorithm":[4,111,123],"that":[5],"computes":[6],"Minimum":[8],"Spanning":[9],"Tree":[10],"(MST)":[11],"in":[12,19],"O(log*":[13,63],"n)":[14,55,64,110,122],"rounds,":[15],"with":[16],"high":[17],"probability,":[18],"the":[20,30,68,106,119],"Congested":[21],"Clique":[22],"model":[23],"of":[24,70,82,112,124],"distributed":[25],"computing.":[26],"In":[27],"this":[28],"model,":[29],"input":[31],"is":[32,61,72],"graph":[34],"on":[35,79],"n":[36],"nodes,":[37],"initially":[38],"each":[39,49],"node":[40],"knows":[41],"only":[42],"its":[43],"incident":[44],"edges,":[45],"and":[46,92,118],"per":[47],"round":[48],"two":[50,83],"nodes":[51],"can":[52],"exchange":[53],"O(log":[54,107,120],"bits.":[56],"Our":[57,101],"key":[58],"technical":[59],"novelty":[60],"an":[62],"Graph":[65],"Connectivity":[66],"algorithm,":[67],"heart":[69],"which":[71],"(recursive)":[74],"forest":[75],"growth":[76],"method,":[77],"based":[78],"combination":[81],"ideas:":[84],"sparsity-sensitive":[86],"sketching":[87],"aimed":[88,97],"at":[89,98],"sparse":[90],"graphs":[91],"random":[94],"edge":[95],"sampling":[96],"dense":[99],"graphs.":[100],"result":[102],"improves":[103],"significantly":[104],"over":[105],"log":[108,109,121],"Hegeman":[113],"et":[114,126],"al.":[115,127],"[PODC":[116],"2015]":[117],"Lotker":[125],"[SPAA":[128],"2003;":[129],"SICOMP":[130],"2005].":[131]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":11},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":13},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}
