{"id":"https://openalex.org/W4391785865","doi":"https://doi.org/10.1007/s00453-024-01209-4","title":"The Time Complexity of Consensus Under Oblivious Message Adversaries","display_name":"The Time Complexity of Consensus Under Oblivious Message Adversaries","publication_year":2024,"publication_date":"2024-02-13","ids":{"openalex":"https://openalex.org/W4391785865","doi":"https://doi.org/10.1007/s00453-024-01209-4"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-024-01209-4","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-024-01209-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01209-4.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01209-4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041191399","display_name":"Kyrill Winkler","orcid":"https://orcid.org/0000-0002-7310-1748"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kyrill Winkler","raw_affiliation_strings":["ITK Engineering, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"ITK Engineering, Vienna, Austria","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025101185","display_name":"Ami Paz","orcid":"https://orcid.org/0000-0002-6629-8335"},"institutions":[{"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/I277688954","display_name":"Universit\u00e9 Paris-Saclay","ror":"https://ror.org/03xjwb503","country_code":"FR","type":"education","lineage":["https://openalex.org/I277688954"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ami Paz","raw_affiliation_strings":["LISN \u2014 CNRS & Paris-Saclay University, Paris, France"],"affiliations":[{"raw_affiliation_string":"LISN \u2014 CNRS & Paris-Saclay University, Paris, France","institution_ids":["https://openalex.org/I277688954","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013755105","display_name":"Hugo Rincon Galeana","orcid":"https://orcid.org/0000-0002-8152-1275"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Hugo Rincon Galeana","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]},{"id":"https://openalex.org/I4210133470","display_name":"Fraunhofer Institute for Secure Information Technology","ror":"https://ror.org/03qt2gs44","country_code":"DE","type":"facility","lineage":["https://openalex.org/I4210133470","https://openalex.org/I4923324"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Stefan Schmid","raw_affiliation_strings":["TU Berlin & Fraunhofer SIT, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"TU Berlin & Fraunhofer SIT, Berlin, Germany","institution_ids":["https://openalex.org/I4210133470","https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006249454","display_name":"Ulrich Schmid","orcid":"https://orcid.org/0000-0001-9831-8583"},"institutions":[{"id":"https://openalex.org/I145847075","display_name":"TU Wien","ror":"https://ror.org/04d836q62","country_code":"AT","type":"education","lineage":["https://openalex.org/I145847075"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Ulrich Schmid","raw_affiliation_strings":["TU Wien, Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"TU Wien, Vienna, Austria","institution_ids":["https://openalex.org/I145847075"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5066080641"],"corresponding_institution_ids":["https://openalex.org/I4210133470","https://openalex.org/I4577782"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.029,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.75446429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":"86","issue":"6","first_page":"1830","last_page":"1861"},"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.9998000264167786,"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.9998000264167786,"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/T13553","display_name":"Age of Information Optimization","score":0.9884999990463257,"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/T12288","display_name":"Optimization and Search Problems","score":0.9876000285148621,"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/theory-of-computation","display_name":"Theory of computation","score":0.7228599190711975},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6235400438308716},{"id":"https://openalex.org/keywords/consensus-algorithm","display_name":"Consensus algorithm","score":0.5903481841087341},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5565142035484314},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.542018473148346},{"id":"https://openalex.org/keywords/consensus","display_name":"Consensus","score":0.5206700563430786},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5141220688819885},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.509818971157074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4956167936325073},{"id":"https://openalex.org/keywords/adversary-model","display_name":"Adversary model","score":0.4916875958442688},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.4839618504047394},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4758424758911133},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3981287479400635},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3946070969104767},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34584754705429077},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1847498118877411},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.12950780987739563}],"concepts":[{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.7228599190711975},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6235400438308716},{"id":"https://openalex.org/C2983222225","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus algorithm","level":2,"score":0.5903481841087341},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5565142035484314},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.542018473148346},{"id":"https://openalex.org/C107107730","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus","level":3,"score":0.5206700563430786},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5141220688819885},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.509818971157074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4956167936325073},{"id":"https://openalex.org/C7606001","wikidata":"https://www.wikidata.org/wiki/Q4686702","display_name":"Adversary model","level":3,"score":0.4916875958442688},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.4839618504047394},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4758424758911133},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3981287479400635},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3946070969104767},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34584754705429077},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1847498118877411},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.12950780987739563},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-024-01209-4","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-024-01209-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01209-4.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-04799403v1","is_oa":true,"landing_page_url":"https://hal.science/hal-04799403","pdf_url":"https://hal.science/hal-04799403v1/file/2202.12397v1%281%29.pdf","source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Algorithmica, 2024, 86 (6), pp.1830-1861. &#x27E8;10.1007/s00453-024-01209-4&#x27E9;","raw_type":"Journal articles"},{"id":"pmh:oai:publica.fraunhofer.de:publica/474472","is_oa":true,"landing_page_url":"https://publica.fraunhofer.de/handle/publica/474472","pdf_url":null,"source":{"id":"https://openalex.org/S4306400318","display_name":"Fraunhofer-Publica (Fraunhofer-Gesellschaft)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4923324","host_organization_name":"Fraunhofer-Gesellschaft","host_organization_lineage":["https://openalex.org/I4923324"],"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":null,"raw_type":"journal article"}],"best_oa_location":{"id":"doi:10.1007/s00453-024-01209-4","is_oa":true,"landing_page_url":"http://dx.doi.org/10.1007/s00453-024-01209-4","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-024-01209-4.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7699999809265137}],"awards":[{"id":"https://openalex.org/G1035468006","display_name":"Dependable Network Data Plane for the Cloud","funder_award_id":"I 5025","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G1748000517","display_name":null,"funder_award_id":"NKFIH","funder_id":"https://openalex.org/F4320336675","funder_display_name":"National Research, Development and Innovation Office"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320324094","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40"},{"id":"https://openalex.org/F4320326762","display_name":"Nemzeti Kutat\u00e1si Fejleszt\u00e9si \u00e9s Innov\u00e1ci\u00f3s Hivatal","ror":null},{"id":"https://openalex.org/F4320336675","display_name":"National Research, Development and Innovation Office","ror":null}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4391785865.pdf"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W1683896837","https://openalex.org/W1824735455","https://openalex.org/W1894549304","https://openalex.org/W1911970323","https://openalex.org/W1970700632","https://openalex.org/W1983966095","https://openalex.org/W1984340066","https://openalex.org/W2001757616","https://openalex.org/W2010075998","https://openalex.org/W2013154696","https://openalex.org/W2025458833","https://openalex.org/W2035362408","https://openalex.org/W2086286040","https://openalex.org/W2120741723","https://openalex.org/W2122284128","https://openalex.org/W2135254481","https://openalex.org/W2137845880","https://openalex.org/W2145278925","https://openalex.org/W2152755966","https://openalex.org/W2155037890","https://openalex.org/W2204883335","https://openalex.org/W2255794321","https://openalex.org/W2280546220","https://openalex.org/W2789563213","https://openalex.org/W2810645111","https://openalex.org/W2897525529","https://openalex.org/W2908176613","https://openalex.org/W2954594477","https://openalex.org/W2964057700","https://openalex.org/W2966487081","https://openalex.org/W3006692216","https://openalex.org/W3013658698","https://openalex.org/W3099717151","https://openalex.org/W4286505183","https://openalex.org/W6745553878"],"related_works":["https://openalex.org/W1940417675","https://openalex.org/W2106670435","https://openalex.org/W2136838521","https://openalex.org/W2246375794","https://openalex.org/W1978666881","https://openalex.org/W4394651929","https://openalex.org/W3201708707","https://openalex.org/W2034250407","https://openalex.org/W2167425623","https://openalex.org/W2916913908"],"abstract_inverted_index":{"Abstract":[0],"We":[1,101],"study":[2],"the":[3,25,89,92,117,123,150],"problem":[4],"of":[5,38,95,119,153],"solving":[6,96],"consensus":[7,51,56,73,97,133,146],"in":[8,13,31,98],"synchronous":[9],"directed":[10],"dynamic":[11],"networks,":[12],"which":[14],"communication":[15,26],"is":[16,58,67],"controlled":[17],"by":[18,62,122],"an":[19,135],"oblivious":[20,136],"message":[21,137],"adversary":[22,138],"that":[23,66,131],"picks":[24],"graph":[27],"to":[28,116,157],"be":[29],"used":[30],"a":[32,35,63,70,77],"round":[33],"from":[34,69],"fixed":[36],"set":[37,79],"graphs":[39],"$$\\textbf{D}$$":[40,80],"<mml:math":[41,81],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[42,82],"<mml:mi>D</mml:mi>":[43,83],"</mml:math>":[44,84],"arbitrarily.":[45],"In":[46],"this":[47,99,109],"fundamental":[48],"model,":[49],"determining":[50],"solvability":[52,74,147],"and":[53,105,112,148],"designing":[54],"efficient":[55],"algorithms":[57],"surprisingly":[59],"difficult.":[60],"Enabled":[61],"decision":[64,124],"procedure":[65],"derived":[68],"well-established":[71],"previous":[72],"characterization":[75],"for":[76,88,108],"given":[78],",":[85],"we":[86,129],"study,":[87],"first":[90],"time,":[91],"time":[93,110],"complexity":[94],"model:":[100],"provide":[102],"both":[103,144],"upper":[104],"lower":[106],"bounds":[107],"complexity,":[111],"also":[113],"relate":[114],"it":[115],"number":[118],"iterations":[120],"required":[121],"procedure.":[125],"Among":[126],"other":[127,159],"results,":[128],"find":[130],"reaching":[132],"under":[134],"can":[139],"take":[140],"exponentially":[141],"longer":[142],"than":[143],"deciding":[145],"broadcasting":[149],"input":[151],"value":[152],"some":[154],"unknown":[155],"process":[156],"all":[158],"processes.":[160]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2024-02-14T00:00:00"}