{"id":"https://openalex.org/W4281727417","doi":"https://doi.org/10.1145/3519935.3520078","title":"Improved communication complexity of fault-tolerant consensus","display_name":"Improved communication complexity of fault-tolerant consensus","publication_year":2022,"publication_date":"2022-06-09","ids":{"openalex":"https://openalex.org/W4281727417","doi":"https://doi.org/10.1145/3519935.3520078"},"language":"en","primary_location":{"id":"doi:10.1145/3519935.3520078","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-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/A5114053165","display_name":"Mohammad Taghi Hajiaghayi","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mohammad T. Hajiaghayi","raw_affiliation_strings":["University of Maryland, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101948468","display_name":"Dariusz R. Kowalski","orcid":"https://orcid.org/0000-0002-1316-7788"},"institutions":[{"id":"https://openalex.org/I25041050","display_name":"Augusta University","ror":"https://ror.org/012mef835","country_code":"US","type":"education","lineage":["https://openalex.org/I25041050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dariusz R. Kowalski","raw_affiliation_strings":["Augusta University, USA"],"affiliations":[{"raw_affiliation_string":"Augusta University, USA","institution_ids":["https://openalex.org/I25041050"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083806946","display_name":"Jan Olkowski","orcid":"https://orcid.org/0000-0001-9278-3935"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jan Olkowski","raw_affiliation_strings":["University of Maryland, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5114053165"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.6907,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.70139813,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"488","last_page":"501"},"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.9998999834060669,"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.9998999834060669,"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.9983999729156494,"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.9937000274658203,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6928321719169617},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6783878803253174},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6146782040596008},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.5328156352043152},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.508356511592865},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5062200427055359},{"id":"https://openalex.org/keywords/adversary-model","display_name":"Adversary model","score":0.5044852495193481},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.48163357377052307},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.47180166840553284},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4592551589012146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4358295202255249},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4205426573753357},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41865769028663635},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4010844826698303},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.381623238325119},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37114420533180237},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3337727189064026},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.07527580857276917}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6928321719169617},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6783878803253174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6146782040596008},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.5328156352043152},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.508356511592865},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5062200427055359},{"id":"https://openalex.org/C7606001","wikidata":"https://www.wikidata.org/wiki/Q4686702","display_name":"Adversary model","level":3,"score":0.5044852495193481},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.48163357377052307},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.47180166840553284},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4592551589012146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4358295202255249},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4205426573753357},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41865769028663635},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4010844826698303},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.381623238325119},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37114420533180237},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3337727189064026},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.07527580857276917},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/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/3519935.3520078","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519935.3520078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1590883019","https://openalex.org/W1964052655","https://openalex.org/W1999147578","https://openalex.org/W2020377431","https://openalex.org/W2037610055","https://openalex.org/W2039164882","https://openalex.org/W2047964326","https://openalex.org/W2147567981","https://openalex.org/W2159716194","https://openalex.org/W2962882087","https://openalex.org/W2974140640","https://openalex.org/W4205300528","https://openalex.org/W4250290052","https://openalex.org/W4281727417"],"related_works":["https://openalex.org/W2036758175","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W1994598067","https://openalex.org/W2963903795","https://openalex.org/W3097369619","https://openalex.org/W2008470896","https://openalex.org/W2061496873","https://openalex.org/W4377371889","https://openalex.org/W4281727417"],"abstract_inverted_index":{"Consensus":[0,70,108],"is":[1,58,91,100,103],"one":[2],"of":[3,39,67,88],"the":[4,28,36,54,86,96,134],"most":[5],"thoroughly":[6],"studied":[7],"problems":[8],"in":[9,27,53,104],"distributed":[10],"computing,":[11],"yet":[12],"there":[13,57],"are":[14],"still":[15,59],"complexity":[16,66,156],"gaps":[17],"that":[18,132],"have":[19],"not":[20],"been":[21],"bridged":[22],"for":[23,114],"decades.":[24],"In":[25],"particular,":[26],"classical":[29],"message-passing":[30],"setting":[31],"with":[32],"processes\u2019":[33],"crashes,":[34],"since":[35],"seminal":[37],"works":[38],"Bar-Joseph":[40],"and":[41,45,47],"Ben-Or":[42],"[PODC":[43],"1998]":[44,52],"Aspnes":[46],"Waarts":[48],"[SICOMP":[49],"1996,":[50],"JACM":[51],"previous":[55],"century,":[56],"a":[60,72,110],"fundamental":[61],"unresolved":[62],"question":[63],"about":[64],"communication":[65,89,121,135],"fast":[68],"randomized":[69,107],"against":[71,109,129],"(strong)":[73],"adaptive":[74,130],"adversary":[75,131],"crashing":[76],"processes":[77],"arbitrarily":[78],"online.":[79],"The":[80],"best":[81,97],"known":[82],"upper":[83],"bound":[84,99],"on":[85],"number":[87],"bits":[90,122,144],"\u0398(n3/2/\u221alogn)":[92],"per":[93,123,145],"process,":[94,146],"while":[95,147],"lower":[98],"\u03a9(1).":[101],"This":[102],"contrast":[105],"to":[106,141,151],"(weak)":[111],"oblivious":[112],"adversary,":[113],"which":[115],"time-almost-optimal":[116],"algorithms":[117],"guarantee":[118],"amortized":[119],"O(1)":[120],"process.":[124],"We":[125],"design":[126],"an":[127],"algorithm":[128],"reduces":[133],"gap":[136],"by":[137],"nearly":[138],"linear":[139],"factor":[140,152],"O(\u221an\u00b7":[142],"n)":[143],"keeping":[148],"almost-optimal":[149],"(up":[150],"O(log3":[153],"n))":[154],"time":[155],"O(\u221an\u00b7log5/2":[157],"n).":[158]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}