{"id":"https://openalex.org/W1975595616","doi":"https://doi.org/10.1145/1248377.1248402","title":"Local MST computation with short advice","display_name":"Local MST computation with short advice","publication_year":2007,"publication_date":"2007-06-09","ids":{"openalex":"https://openalex.org/W1975595616","doi":"https://doi.org/10.1145/1248377.1248402","mag":"1975595616"},"language":"en","primary_location":{"id":"doi:10.1145/1248377.1248402","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1248377.1248402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://hal.science/hal-00154849","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110465085","display_name":"Pierre Fraigniaud","orcid":null},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pierre Fraigniaud","raw_affiliation_strings":["CNRS and University Paris 7, Paris, France"],"affiliations":[{"raw_affiliation_string":"CNRS and University Paris 7, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040995971","display_name":"Amos Korman","orcid":"https://orcid.org/0000-0001-8652-9228"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Amos Korman","raw_affiliation_strings":["Technion, Haifa, Israel","Technion , Haifa , Israel"],"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]},{"raw_affiliation_string":"Technion , Haifa , Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054435097","display_name":"Emmanuelle Lebhar","orcid":null},"institutions":[{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Emmanuelle Lebhar","raw_affiliation_strings":["CNRS and University Paris 7, Paris, France"],"affiliations":[{"raw_affiliation_string":"CNRS and University Paris 7, Paris, France","institution_ids":["https://openalex.org/I204730241","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110465085"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I204730241"],"apc_list":null,"apc_paid":null,"fwci":6.7379,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.96901465,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"154","last_page":"160"},"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.9990000128746033,"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.9990000128746033,"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.9980999827384949,"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.9947999715805054,"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/computation","display_name":"Computation","score":0.6657217741012573},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.633430004119873},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.5652275085449219},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5438180565834045},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5291954278945923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5219059586524963},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4940374493598938},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.48959046602249146},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48489195108413696},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4729956090450287},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.45900627970695496},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4555470049381256},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44427937269210815},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43789181113243103},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.43019339442253113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4234084486961365},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3680489659309387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2787531316280365},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09885707497596741}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6657217741012573},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.633430004119873},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.5652275085449219},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5438180565834045},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5291954278945923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5219059586524963},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4940374493598938},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.48959046602249146},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48489195108413696},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4729956090450287},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.45900627970695496},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4555470049381256},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44427937269210815},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43789181113243103},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.43019339442253113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4234084486961365},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3680489659309387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2787531316280365},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09885707497596741},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/1248377.1248402","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1248377.1248402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.107.4491","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.107.4491","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.liafa.jussieu.fr/~pierref/POSTSCRIPTS/SPAA07b.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.9500","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.9500","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://iew3.technion.ac.il/~pandit/MST-computation.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.390.2619","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.390.2619","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ce.sharif.ac.ir/~ghodsi/archive/d-papers/SPAA/2007/Local MST Computation with Short Advice.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00154849v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00154849","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Symposium on Parallel Algorithms and Architectures, Jun 2007, San Diego, United States. pp.154","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-00154849v1","is_oa":true,"landing_page_url":"https://hal.science/hal-00154849","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Symposium on Parallel Algorithms and Architectures, Jun 2007, San Diego, United States. pp.154","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1481761413","https://openalex.org/W1501234213","https://openalex.org/W1502647632","https://openalex.org/W1568961751","https://openalex.org/W1945440063","https://openalex.org/W1971426115","https://openalex.org/W1985361054","https://openalex.org/W1987314757","https://openalex.org/W1995565757","https://openalex.org/W2023425290","https://openalex.org/W2030982625","https://openalex.org/W2032607682","https://openalex.org/W2053788000","https://openalex.org/W2053981136","https://openalex.org/W2054910423","https://openalex.org/W2077321659","https://openalex.org/W2077371116","https://openalex.org/W2084206787","https://openalex.org/W2100466311","https://openalex.org/W2147327383","https://openalex.org/W2165441947","https://openalex.org/W2172178473","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4205300528","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W2099915933","https://openalex.org/W2418231958","https://openalex.org/W4380840098","https://openalex.org/W3116169590","https://openalex.org/W1703428550","https://openalex.org/W2044443696","https://openalex.org/W3101281637","https://openalex.org/W2390742649","https://openalex.org/W1561849181","https://openalex.org/W3081212354"],"abstract_inverted_index":{"We":[0,211],"use":[1],"the":[2,10,55,59,68,81,89,101,128,133,137,160,188,202,214,218,221,240,264,268],"recently":[3],"introduced":[4],"advising":[5],"scheme":[6,23,121,150,166,229,247],"framework":[7],"for":[8,24,32,122,167,230,248],"measuring":[9],"difficulty":[11],"of":[12,37,58,87,95,112,132,139,162,177,179,192,206,217,234,252,267],"locally":[13],"distributively":[14,74],"computing":[15],"a":[16,25,30,44,96,117,174,208],"Minimum":[17],"Spanning":[18],"Tree":[19],"(MST).":[20],"An":[21],"(m,t)-advising":[22],"distributed":[26,189],"problem":[27,69,203],"P":[28,70],"is":[29,61,100,116,126,145,159,257,260],"way,":[31],"every":[33],"possible":[34],"input":[35],"I":[36,48],"P,":[38],"to":[39,49,104,136,181,198,262,272],"provide":[40],"an":[41,163,245],"\"advice\"":[42],"(i.e.,":[43],"bit":[45],"string)":[46],"about":[47],"each":[50,93,182],"node":[51,94,125],"so":[52],"that:":[53],"(1)":[54],"maximum":[56],"size":[57,216,236,266],"advices":[60,82,233,251,269],"at":[62,76],"most":[63,77],"m":[64],"bits,":[65],"and":[66,143],"(2)":[67],"can":[71,185],"be":[72],"solved":[73],"in":[75,107,194,204],"t":[78,152],"rounds":[79],"using":[80],"as":[83],"inputs.":[84],"In":[85],"case":[86],"MST,":[88],"output":[90],"returned":[91],"by":[92,171],"weighted":[97],"graph":[98],"G":[99],"edge":[102,134],"leading":[103,135],"its":[105],"parent":[106],"some":[108,140],"rooted":[109],"MST":[110,123,141,193,231,249],"T":[111],"G.":[113],"Clearly,":[114],"there":[115],"trivial":[118],"(log":[119],"n,0)-advising":[120],"(each":[124],"given":[127],"local":[129],"port":[130],"number":[131,176],"root":[138],"T),":[142],"it":[144],"known":[146],"that":[147,226,256],"any":[148,207,227],"(0,t)-advising":[149],"satisfies":[151],"\u2265":[153],"\u03a9":[154],"(\u221an).":[155],"Our":[156],"main":[157],"result":[158],"construction":[161],"(O(1),O(log":[164],"n))-advising":[165],"MST.":[168],"That":[169],"is,":[170],"only":[172],"giving":[173],"constant":[175,253],"bits":[178],"advice":[180],"node,":[183],"one":[184,222,258],"decrease":[186,263],"exponentially":[187],"computation":[190],"time":[191],"arbitrary":[195],"graph,":[196],"compared":[197],"algorithms":[199],"dealing":[200],"with":[201,250],"absence":[205],"priori":[209],"information.":[210],"also":[212],"consider":[213],"average":[215,235,254,265],"advices.":[219],"On":[220,239],"hand,":[223],"we":[224,243],"show":[225],"(m,0)-advising":[228],"gives":[232],"\u03a9(log":[237],"n).":[238],"other":[241],"hand":[242],"design":[244],"(m,1)-advising":[246],"size,":[255],"round":[259],"enough":[261],"from":[270],"log(n)":[271],"constant.":[273]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}