{"id":"https://openalex.org/W2467525240","doi":"https://doi.org/10.1145/2935764.2935795","title":"Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures","display_name":"Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures","publication_year":2016,"publication_date":"2016-07-08","ids":{"openalex":"https://openalex.org/W2467525240","doi":"https://doi.org/10.1145/2935764.2935795","mag":"2467525240"},"language":"en","primary_location":{"id":"doi:10.1145/2935764.2935795","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935795","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935795&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","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=2935795&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":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mohsen Ghaffari","raw_affiliation_strings":["CSAIL, MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"CSAIL, MIT, Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022875077","display_name":"Merav Parter","orcid":"https://orcid.org/0000-0002-2357-2445"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Merav Parter","raw_affiliation_strings":["CSAIL, MIT, Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"CSAIL, MIT, Cambridge, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088284921"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0268,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.87914912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"387","last_page":"396"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9983999729156494,"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/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9955000281333923,"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/computer-science","display_name":"Computer science","score":0.72548508644104},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6864163875579834},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.629004716873169},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.6015526056289673},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5756555795669556},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.5670466423034668},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5653730630874634},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5453457832336426},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48866990208625793},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4857650101184845},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.485342413187027},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4751933813095093},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4580773711204529},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4543849229812622},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4283146858215332},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19433346390724182},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.14423322677612305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.13849270343780518},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.106223464012146},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08740234375}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.72548508644104},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6864163875579834},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.629004716873169},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.6015526056289673},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5756555795669556},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.5670466423034668},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5653730630874634},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5453457832336426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48866990208625793},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4857650101184845},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.485342413187027},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4751933813095093},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4580773711204529},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4543849229812622},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4283146858215332},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19433346390724182},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.14423322677612305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.13849270343780518},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.106223464012146},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08740234375},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2935764.2935795","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935795","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935795&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/2935764.2935795","is_oa":true,"landing_page_url":"https://doi.org/10.1145/2935764.2935795","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=2935795&type=pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"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/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":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2467525240.pdf","grobid_xml":"https://content.openalex.org/works/W2467525240.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W1568961751","https://openalex.org/W1638683514","https://openalex.org/W1815926779","https://openalex.org/W1866422804","https://openalex.org/W1923967086","https://openalex.org/W1945440063","https://openalex.org/W1963633992","https://openalex.org/W1969916852","https://openalex.org/W1980943820","https://openalex.org/W1997845342","https://openalex.org/W2005900781","https://openalex.org/W2012634103","https://openalex.org/W2014447809","https://openalex.org/W2026575677","https://openalex.org/W2026798971","https://openalex.org/W2030825457","https://openalex.org/W2039634593","https://openalex.org/W2047233027","https://openalex.org/W2048098617","https://openalex.org/W2048500523","https://openalex.org/W2063844956","https://openalex.org/W2068871408","https://openalex.org/W2073094163","https://openalex.org/W2083795876","https://openalex.org/W2084427019","https://openalex.org/W2094099891","https://openalex.org/W2103027585","https://openalex.org/W2134729426","https://openalex.org/W2172178473","https://openalex.org/W2568458273","https://openalex.org/W3199417267","https://openalex.org/W4245095675","https://openalex.org/W6723629830"],"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":{"Tree":[0,55],"structures":[1,19,28],"such":[2],"as":[3],"breadth-first":[4],"search":[5],"(BFS)":[6],"trees":[7,11],"and":[8,34],"minimum":[9],"spanning":[10],"(MST)":[12],"are":[13,29],"among":[14],"the":[15,58,66,70,73,98,101],"most":[16],"fundamental":[17],"graph":[18],"in":[20],"distributed":[21,106,109],"network":[22,67],"algorithms.":[23],"However,":[24,96],"by":[25],"definition,":[26],"these":[27],"not":[30,112],"robust":[31],"against":[32],"failures":[33],"even":[35,77],"a":[36,93],"single":[37],"edge's":[38],"removal":[39],"can":[40],"disrupt":[41],"their":[42,108],"functionality.":[43],"A":[44],"well-studied":[45],"concept":[46],"which":[47],"attempts":[48],"to":[49],"circumvent":[50],"this":[51],"issue":[52],"is":[53,75],"Fault-Tolerant":[54],"Structures,":[56],"where":[57],"tree":[59],"gets":[60],"augmented":[61],"with":[62],"additional":[63],"edges":[64],"from":[65,92,105],"so":[68],"that":[69,100],"functionality":[71],"of":[72],"structure":[74],"maintained":[76],"when":[78],"an":[79],"edge":[80],"fails.":[81],"These":[82],"structures,":[83],"or":[84],"other":[85],"equivalent":[86],"formulations,":[87],"have":[88],"been":[89,113],"studied":[90],"extensively":[91],"centralized":[94],"viewpoint.":[95],"despite":[97],"fact":[99],"main":[102],"motivations":[103],"come":[104],"networks,":[107],"construction":[110],"has":[111],"addressed":[114],"before.":[115]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}