{"id":"https://openalex.org/W2737872496","doi":"https://doi.org/10.1145/3087801.3087827","title":"Distributed MST and Routing in Almost Mixing Time","display_name":"Distributed MST and Routing in Almost Mixing Time","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2737872496","doi":"https://doi.org/10.1145/3087801.3087827","mag":"2737872496"},"language":"en","primary_location":{"id":"doi:10.1145/3087801.3087827","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087827","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/A5088284921","display_name":"Mohsen Ghaffari","orcid":"https://orcid.org/0000-0002-1939-9053"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["ETH Z\u00fcrich, Zurich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023808567","display_name":"Fabian K\u00fchn","orcid":"https://orcid.org/0000-0002-1025-5037"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Fabian Kuhn","raw_affiliation_strings":["University of Freiburg, Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Freiburg, Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005437771","display_name":"Hsin-Hao Su","orcid":"https://orcid.org/0009-0002-7970-9604"},"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":"Hsin-Hao Su","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":null,"apc_paid":null,"fwci":4.0658,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.94771421,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"131","last_page":"140"},"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.9988999962806702,"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.9988999962806702,"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/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"}},{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":0.9962999820709229,"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.6871362924575806},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6625065207481384},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6140679121017456},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5463895201683044},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5182578563690186},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.497712641954422},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.49015411734580994},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4836248457431793},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4761107861995697},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4434248208999634},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4338456094264984},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4153740108013153},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.15998834371566772},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11898157000541687}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6871362924575806},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6625065207481384},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6140679121017456},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5463895201683044},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5182578563690186},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.497712641954422},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.49015411734580994},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4836248457431793},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4761107861995697},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4434248208999634},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4338456094264984},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4153740108013153},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.15998834371566772},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11898157000541687},{"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/3087801.3087827","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087827","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":78,"referenced_works":["https://openalex.org/W816673839","https://openalex.org/W1497938971","https://openalex.org/W1508113861","https://openalex.org/W1514107797","https://openalex.org/W1544141825","https://openalex.org/W1586184796","https://openalex.org/W1666479227","https://openalex.org/W1845051857","https://openalex.org/W1847535063","https://openalex.org/W1854214752","https://openalex.org/W1866858131","https://openalex.org/W1921591048","https://openalex.org/W1945440063","https://openalex.org/W1969534344","https://openalex.org/W1985361054","https://openalex.org/W1992254899","https://openalex.org/W1992996565","https://openalex.org/W2002658910","https://openalex.org/W2005900781","https://openalex.org/W2015819397","https://openalex.org/W2030825457","https://openalex.org/W2030982625","https://openalex.org/W2032312374","https://openalex.org/W2032607682","https://openalex.org/W2039765418","https://openalex.org/W2040011014","https://openalex.org/W2052312304","https://openalex.org/W2053788000","https://openalex.org/W2053981136","https://openalex.org/W2056695987","https://openalex.org/W2058191123","https://openalex.org/W2061086123","https://openalex.org/W2063832254","https://openalex.org/W2063844956","https://openalex.org/W2068871408","https://openalex.org/W2071346873","https://openalex.org/W2077371116","https://openalex.org/W2084206787","https://openalex.org/W2100466311","https://openalex.org/W2106285343","https://openalex.org/W2107008873","https://openalex.org/W2107805020","https://openalex.org/W2126665244","https://openalex.org/W2139535340","https://openalex.org/W2145492278","https://openalex.org/W2150148016","https://openalex.org/W2158049821","https://openalex.org/W2159164612","https://openalex.org/W2159863405","https://openalex.org/W2163067248","https://openalex.org/W2163097371","https://openalex.org/W2163841653","https://openalex.org/W2167167562","https://openalex.org/W2170420565","https://openalex.org/W2172178473","https://openalex.org/W2174199856","https://openalex.org/W2206897606","https://openalex.org/W2294674552","https://openalex.org/W2313024697","https://openalex.org/W2344116943","https://openalex.org/W2347049918","https://openalex.org/W2484918492","https://openalex.org/W2488670996","https://openalex.org/W2515165863","https://openalex.org/W2548025525","https://openalex.org/W2610202827","https://openalex.org/W2739466586","https://openalex.org/W2797228403","https://openalex.org/W2949694027","https://openalex.org/W2950813619","https://openalex.org/W2952490263","https://openalex.org/W2952697254","https://openalex.org/W2953390354","https://openalex.org/W3104014862","https://openalex.org/W4235717771","https://openalex.org/W4250390143","https://openalex.org/W4254419859","https://openalex.org/W4315691002"],"related_works":["https://openalex.org/W2126708852","https://openalex.org/W2011106535","https://openalex.org/W1978086920","https://openalex.org/W1994598067","https://openalex.org/W2036758175","https://openalex.org/W2123350362","https://openalex.org/W2007715402","https://openalex.org/W2489999748","https://openalex.org/W2475816962","https://openalex.org/W2004524662"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,8,33,37,74,86,157],"randomized":[3],"distributed":[4,75],"algorithm":[5,114],"that":[6,134],"computes":[7],"minimum":[9],"spanning":[10],"tree":[11],"in":[12,21,70,104,106,124,152],"\u03c4(G)":[13,125],"\u00b7":[14,126],"2O(\u221a(log":[15,127],"n":[16,128],"log":[17,18,129,130],"n)))":[19],"rounds,":[20,132],"any":[22],"n-node":[23],"graph":[24],"G":[25],"with":[26],"mixing":[27],"time":[28,111],"\u03c4(G).":[29],"This":[30],"result":[31,72,155],"provides":[32],"sub-polynomial":[34],"complexity":[35],"for":[36,62,77,143],"wide":[38],"range":[39],"of":[40,42,54,88,110,161,174],"graphs":[41,164],"practical":[43],"interest,":[44],"and":[45,91,119],"goes":[46],"below":[47],"the":[48,107,139,166],"celebrated":[49],"\u03a9(D+":[50],"\u221an)":[51],"lower":[52],"bound":[53],"Das":[55],"Sarma":[56],"et":[57],"al.":[58],"[STOC'11]":[59],"which":[60,169],"holds":[61],"some":[63],"worst-case":[64],"general":[65],"graphs.":[66],"The":[67,148],"core":[68],"novelty":[69],"this":[71,81,153,178],"is":[73,84,138,156],"method":[76],"permutation":[78],"routing.":[79],"In":[80],"problem,":[82],"one":[83,95],"given":[85],"number":[87],"source-destination":[89],"pairs,":[90],"we":[92,170],"should":[93],"deliver":[94,120],"packet":[96],"from":[97],"each":[98,135],"source":[99,140],"to":[100,117],"its":[101],"destination,":[102],"all":[103,121],"parallel,":[105],"shortest":[108],"span":[109],"possible.":[112],"Our":[113],"allows":[115],"us":[116],"route":[118],"these":[122],"packets":[123],"n))":[131],"assuming":[133],"node":[136],"v":[137],"or":[141],"destination":[142],"at":[144],"most":[145],"dG(v)":[146],"packets.":[147],"main":[149],"technical":[150],"ingredient":[151],"routing":[154],"certain":[158],"hierarchical":[159],"embedding":[160],"good-expansion":[162],"random":[163],"on":[165],"base":[167],"graph,":[168],"believe":[171],"can":[172],"be":[173],"interest":[175],"well":[176],"beyond":[177],"work.":[179]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-25T08:39:21.599409","created_date":"2025-10-10T00:00:00"}