{"id":"https://openalex.org/W4286210572","doi":"https://doi.org/10.1145/3519270.3538421","title":"State Complexity of Protocols with Leaders","display_name":"State Complexity of Protocols with Leaders","publication_year":2022,"publication_date":"2022-07-20","ids":{"openalex":"https://openalex.org/W4286210572","doi":"https://doi.org/10.1145/3519270.3538421"},"language":"en","primary_location":{"id":"doi:10.1145/3519270.3538421","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2109.15171","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014652670","display_name":"J\u00e9r\u00f4me Leroux","orcid":"https://orcid.org/0000-0002-7214-9467"},"institutions":[{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"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"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"J\u00e9r\u00f4me Leroux","raw_affiliation_strings":["LaBRI, CNRS, Univ. Bordeaux, Talence, France","Laboratoire Bordelais de Recherche en Informatique"],"affiliations":[{"raw_affiliation_string":"LaBRI, CNRS, Univ. Bordeaux, Talence, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189","https://openalex.org/I1294671590"]},{"raw_affiliation_string":"Laboratoire Bordelais de Recherche en Informatique","institution_ids":["https://openalex.org/I4210142254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5014652670"],"corresponding_institution_ids":["https://openalex.org/I4210142254","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210160189"],"apc_list":null,"apc_paid":null,"fwci":0.42848349,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.55702357,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"257","last_page":"264"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"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/T12029","display_name":"DNA and Biological Computing","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9975000023841858,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.686532199382782},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6403042674064636},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.6282646656036377},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5833208560943604},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4957162141799927},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.493918240070343},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4875637888908386},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46445581316947937},{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.45121315121650696},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44999775290489197},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.43923380970954895},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.42506933212280273},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3955092132091522},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3888009190559387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29134243726730347},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10064443945884705}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.686532199382782},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6403042674064636},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.6282646656036377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5833208560943604},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4957162141799927},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.493918240070343},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4875637888908386},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46445581316947937},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.45121315121650696},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44999775290489197},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.43923380970954895},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.42506933212280273},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3955092132091522},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3888009190559387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29134243726730347},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10064443945884705},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","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/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3519270.3538421","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538421","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2109.15171","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2109.15171","pdf_url":"https://arxiv.org/pdf/2109.15171","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"pmh:oai:HAL:hal-03863775v1","is_oa":true,"landing_page_url":"https://cnrs.hal.science/hal-03863775","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":"PODC '22: ACM Symposium on Principles of Distributed Computing, Jul 2022, Salerno, Italy. pp.257-264, &#x27E8;10.1145/3519270.3538421&#x27E9;","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2109.15171","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2109.15171","pdf_url":"https://arxiv.org/pdf/2109.15171","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},"sustainable_development_goals":[{"score":0.47999998927116394,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G4076119974","display_name":null,"funder_award_id":"ANR-17-CE40-0028","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":14,"referenced_works":["https://openalex.org/W1524248088","https://openalex.org/W2055081868","https://openalex.org/W2091275311","https://openalex.org/W2098579316","https://openalex.org/W2123429492","https://openalex.org/W2274165758","https://openalex.org/W2424307510","https://openalex.org/W2706788079","https://openalex.org/W2768998600","https://openalex.org/W2782101417","https://openalex.org/W3013273637","https://openalex.org/W3133482207","https://openalex.org/W4226281292","https://openalex.org/W4380874003"],"related_works":["https://openalex.org/W1547206149","https://openalex.org/W2054891275","https://openalex.org/W2364373416","https://openalex.org/W2042218267","https://openalex.org/W1577005250","https://openalex.org/W2352272361","https://openalex.org/W1871461366","https://openalex.org/W2379635044","https://openalex.org/W1983915440","https://openalex.org/W3095925971"],"abstract_inverted_index":{"Population":[0],"protocols":[1],"are":[2,15],"a":[3,23,60,95],"model":[4],"of":[5,42,63],"computation":[6],"in":[7,17,44,88,105],"which":[8,72],"an":[9,36],"arbitrary":[10],"number\\nof":[11],"anonymous":[12],"finite-memory":[13],"agents":[14,43],"interacting":[16],"order":[18],"to":[19,94],"decide":[20],"by":[21,79],"stable\\nconsensus":[22],"predicate.":[24],"In":[25,52],"this":[26,89],"paper,":[27],"we":[28],"focus":[29],"on":[30],"the":[31,40,73],"counting":[32,74],"predicates":[33],"that\\nasks,":[34],"given":[35],"initial":[37],"configuration,":[38],"whether":[39],"number":[41,62],"some\\ninitial":[45],"state":[46],"$i$":[47],"is":[48,76],"at":[49,82,103],"least":[50],"$n$.":[51],"2018,":[53],"Blondin,":[54],"Esparza,":[55],"and":[56,65],"Jaax":[57],"shown\\nthat":[58],"with":[59,81],"fix":[61],"leaders":[64],"interaction-width,":[66],"there":[67],"exists\\ninfinitely":[68],"many":[69],"$n$":[70],"for":[71],"predicate":[75],"stably":[77],"computable":[78],"a\\nprotocol":[80],"most":[83],"$O(\\\\log\\\\log(n))$":[84],"states.":[85],"We":[86],"provide":[87],"paper":[90],"a\\nmatching":[91],"lower-bound":[92,101],"(up":[93],"square":[96],"root)":[97],"that":[98],"improves":[99],"the\\ninverse-Ackermannian":[100],"presented":[102],"PODC":[104],"2021.\\n":[106]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
