{"id":"https://openalex.org/W2619218210","doi":"https://doi.org/10.1145/3039870","title":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","display_name":"Time vs. Information Tradeoffs for Leader Election in Anonymous Trees","publication_year":2017,"publication_date":"2017-03-06","ids":{"openalex":"https://openalex.org/W2619218210","doi":"https://doi.org/10.1145/3039870","mag":"2619218210"},"language":"en","primary_location":{"id":"doi:10.1145/3039870","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3039870","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-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/A5035402609","display_name":"Christian Glacet","orcid":"https://orcid.org/0000-0002-6289-2927"},"institutions":[{"id":"https://openalex.org/I4210100607","display_name":"Institute of Electronics, Computer and Telecommunication Engineering","ror":"https://ror.org/00n4jbh84","country_code":"IT","type":"facility","lineage":["https://openalex.org/I4210100607","https://openalex.org/I4210155236"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Christian Glacet","raw_affiliation_strings":["CNR -IEIIT, Torino, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNR -IEIIT, Torino, Italy","institution_ids":["https://openalex.org/I4210100607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088294743","display_name":"Avery Miller","orcid":"https://orcid.org/0000-0002-8231-3697"},"institutions":[{"id":"https://openalex.org/I33217400","display_name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","ror":"https://ror.org/011pqxa69","country_code":"CA","type":"education","lineage":["https://openalex.org/I33217400","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Avery Miller","raw_affiliation_strings":["Universit\u00e9 du Qu\u00e9bec en Outaouais"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 du Qu\u00e9bec en Outaouais","institution_ids":["https://openalex.org/I33217400"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102714160","display_name":"Andrzej Pelc","orcid":"https://orcid.org/0000-0003-0598-1218"},"institutions":[{"id":"https://openalex.org/I33217400","display_name":"Universit\u00e9 du Qu\u00e9bec en Outaouais","ror":"https://ror.org/011pqxa69","country_code":"CA","type":"education","lineage":["https://openalex.org/I33217400","https://openalex.org/I49663120"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Andrzej Pelc","raw_affiliation_strings":["Universit\u00e9 du Qu\u00e9bec en Outaouais"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 du Qu\u00e9bec en Outaouais","institution_ids":["https://openalex.org/I33217400"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.9789,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.92203699,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":"3","first_page":"1","last_page":"41"},"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.9998000264167786,"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.9998000264167786,"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/T10237","display_name":"Cryptography and Data Security","score":0.9997000098228455,"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"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.855724036693573},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.621186375617981},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6106461882591248},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6058129072189331},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5569837093353271},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.507077693939209},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4767116904258728},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4751536548137665},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.45203956961631775},{"id":"https://openalex.org/keywords/advice","display_name":"Advice (programming)","score":0.42889949679374695},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4164086580276489},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4139222204685211},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.4125276207923889},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4011344313621521},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35942232608795166},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.356514036655426},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3480398654937744},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24542605876922607}],"concepts":[{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.855724036693573},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.621186375617981},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6106461882591248},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6058129072189331},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5569837093353271},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.507077693939209},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4767116904258728},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4751536548137665},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.45203956961631775},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.42889949679374695},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4164086580276489},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4139222204685211},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.4125276207923889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4011344313621521},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35942232608795166},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.356514036655426},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3480398654937744},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24542605876922607},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/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/3039870","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3039870","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.699999988079071,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G3509628427","display_name":"Distributed Computing : computability and complexity","funder_award_id":"ANR-11-BS02-0014","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W164544547","https://openalex.org/W1488020469","https://openalex.org/W1498909462","https://openalex.org/W1568961751","https://openalex.org/W1947002865","https://openalex.org/W1949215090","https://openalex.org/W1968191405","https://openalex.org/W1971694274","https://openalex.org/W1975011672","https://openalex.org/W1983693678","https://openalex.org/W1994101575","https://openalex.org/W1999527722","https://openalex.org/W2003002196","https://openalex.org/W2006162221","https://openalex.org/W2012809967","https://openalex.org/W2017534864","https://openalex.org/W2025590344","https://openalex.org/W2033487809","https://openalex.org/W2034501275","https://openalex.org/W2038319432","https://openalex.org/W2045446569","https://openalex.org/W2046334554","https://openalex.org/W2056295140","https://openalex.org/W2066431556","https://openalex.org/W2072269078","https://openalex.org/W2078479354","https://openalex.org/W2087596759","https://openalex.org/W2089155578","https://openalex.org/W2093606353","https://openalex.org/W2109659895","https://openalex.org/W2112906671","https://openalex.org/W2124068769","https://openalex.org/W2148085206","https://openalex.org/W2160068848","https://openalex.org/W2174013141","https://openalex.org/W2181598850","https://openalex.org/W2474402244","https://openalex.org/W2611515161","https://openalex.org/W2630202923","https://openalex.org/W2753176400","https://openalex.org/W4205300528","https://openalex.org/W6676895103"],"related_works":["https://openalex.org/W2789179878","https://openalex.org/W2601062540","https://openalex.org/W3097369619","https://openalex.org/W3209455166","https://openalex.org/W4302907686","https://openalex.org/W1973013791","https://openalex.org/W2952144494","https://openalex.org/W4287691960","https://openalex.org/W3046990805","https://openalex.org/W2906741610"],"abstract_inverted_index":{"Leader":[0],"election":[1,69,113,146,156,230,274],"is":[2,70,86,119,160,178,198,387,393,409,413],"one":[3],"of":[4,16,32,53,60,67,77,91,131,167,195,202,224,237,266,296,312,319,328,335,362,375,403,445],"the":[5,26,30,33,51,54,58,61,65,78,104,124,129,141,165,184,190,200,221,343,381,391,401,404,443],"fundamental":[6],"problems":[7],"in":[8,114,147,150,157,231,275,342,425],"distributed":[9],"computing.":[10],"It":[11],"calls":[12],"for":[13,153,284,316,332,352,430,435,442],"all":[14,46,96,151,162,181],"nodes":[15,31,47,59,142,182],"a":[17,22,41,82,89,101,138,206,256,372,422],"network":[18,34,62,79],"to":[19,49,120,135,140,143,180,211,227,248,339],"agree":[20],"on":[21,40,220],"single":[23,42,175],"node,":[24,103],"called":[25,199],"leader":[27,68,112,145,155,212,229,273],".":[28,204,271,337],"If":[29,57],"have":[35,48],"distinct":[36],"labels,":[37],"then":[38],"agreeing":[39],"node":[43,75],"means":[44],"that":[45,95,133],"output":[50,81],"label":[52],"elected":[55],"leader.":[56,105],"are":[63,244],"anonymous,":[64],"task":[66],"formulated":[71],"as":[72,88],"follows:":[73],"every":[74],"v":[76],"must":[80],"simple":[83],"path,":[84],"which":[85,154],"coded":[87],"sequence":[90],"port":[92],"numbers,":[93],"such":[94],"these":[97],"paths":[98],"end":[99],"at":[100,161,183,394],"common":[102],"In":[106],"this":[107,158,172,196,426,457],"article,":[108],"we":[109,214,289,305,357,449],"study":[110],"deterministic":[111],"anonymous":[115],"trees.":[116],"Our":[117],"aim":[118],"establish":[121],"tradeoffs":[122],"between":[123],"allocated":[125,210],"time":[126,148,159,208,232,276,285,301,392,412,427,431,458],"\u03c4":[127,149,209],"and":[128,217,241,293,309,322,325,371,411,454],"amount":[130],"information":[132,173],"has":[134],"be":[136,261,279],"given":[137,207],"priori":[139],"enable":[144],"trees":[152],"possible.":[163],"Following":[164],"framework":[166],"algorithms":[168],"with":[169,400],"advice":[170,203,225],",":[171,321,348],"(a":[174],"binary":[176],"string)":[177],"provided":[179],"start":[185],"by":[186,255],"an":[187,262,359],"oracle":[188],"knowing":[189],"entire":[191],"tree.":[192],"The":[193],"length":[194],"string":[197],"size":[201,223],"For":[205,234,300],"election,":[213],"give":[215,290,306,451],"upper":[216,240,292,308,324,360,453],"lower":[218,242,294,310,326,373,455],"bounds":[219,243,295,311,327,419],"minimum":[222],"sufficient":[226],"perform":[228],"\u03c4.":[233],"most":[235,395],"values":[236,318,334],"\u03c4,":[238],"our":[239,418],"either":[245],"tight":[246,291,307,323,452],"up":[247],"multiplicative":[249],"constants,":[250],"or":[251,389],"they":[252],"differ":[253],"only":[254,421],"logarithmic":[257,423],"factor.":[258],"Let":[259],"T":[260],"n":[263,330,365,367,377,460],"-node":[264],"tree":[265],"diameter":[267],"diam":[268,277,286,302,320,336,347,349,386,396,408,415,434],"\u2a7d":[269],"D":[270,298,314,369,379],"While":[272],"can":[278],"performed":[280],"without":[281],"any":[282,436],"advice,":[283],"\u2212":[287,303,350,397,416],"1":[288],"\u0398(log":[297,313,329],").":[299,461],"2":[304],")":[315,331,370],"even":[317,410],"odd":[333,388],"Moving":[338],"shorter":[340],"time,":[341],"interval":[344],"[\u03b2":[345],"\u00b7":[346,433],"3]":[351],"constant":[353,437],"\u03b2":[354],">":[355],"1/2,":[356],"prove":[358],"bound":[361,374],"O":[363],"(":[364],"log":[366],"/":[368,378],"\u03a9(":[376],"),":[380],"latter":[382],"being":[383],"valid":[384],"whenever":[385],"when":[390,407],"4.":[398],"Hence,":[399],"exception":[402],"special":[405],"case":[406,444],"exactly":[414],"3,":[417],"leave":[420],"gap":[424],"interval.":[428],"Finally,":[429],"\u03b1":[432,438],"<":[439],"1/2":[440],"(except":[441],"very":[446],"small":[447],"diameters),":[448],"again":[450],"bounds,":[456],"\u0398(":[459]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}