{"id":"https://openalex.org/W9664036","doi":"https://doi.org/10.1007/s00446-017-0315-1","title":"Communication-efficient randomized consensus","display_name":"Communication-efficient randomized consensus","publication_year":2017,"publication_date":"2017-10-14","ids":{"openalex":"https://openalex.org/W9664036","doi":"https://doi.org/10.1007/s00446-017-0315-1","mag":"9664036"},"language":"en","primary_location":{"id":"doi:10.1007/s00446-017-0315-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00446-017-0315-1","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00446-017-0315-1.pdf","source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"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":"Distributed Computing","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%2Fs00446-017-0315-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083822059","display_name":"Dan Alistarh","orcid":"https://orcid.org/0000-0003-3650-940X"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]},{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT","CH"],"is_corresponding":true,"raw_author_name":"Dan Alistarh","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland","IST Austria, Klosterneuburg, Austria"],"affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"IST Austria, Klosterneuburg, Austria","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036421091","display_name":"James Aspnes","orcid":"https://orcid.org/0000-0001-6188-1663"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James Aspnes","raw_affiliation_strings":["Department of Computer Science, Yale University, New Haven, CT, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Yale University, New Haven, CT, USA","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110426531","display_name":"Valerie King","orcid":"https://orcid.org/0000-0001-5138-6925"},"institutions":[{"id":"https://openalex.org/I212119943","display_name":"University of Victoria","ror":"https://ror.org/04s5mat29","country_code":"CA","type":"education","lineage":["https://openalex.org/I212119943"]},{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]},{"id":"https://openalex.org/I4210107338","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210107338"]}],"countries":["CA","US"],"is_corresponding":false,"raw_author_name":"Valerie King","raw_affiliation_strings":["Institute for Advanced Study, Princeton, NJ, USA","Simons Institute for the Theory of Computing, Berkeley, CA, USA","University of Victoria, Victoria, BC, Canada"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Princeton, NJ, USA","institution_ids":["https://openalex.org/I40036882"]},{"raw_affiliation_string":"Simons Institute for the Theory of Computing, Berkeley, CA, USA","institution_ids":["https://openalex.org/I4210107338"]},{"raw_affiliation_string":"University of Victoria, Victoria, BC, Canada","institution_ids":["https://openalex.org/I212119943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039997672","display_name":"Jared Saia","orcid":"https://orcid.org/0000-0002-3376-7334"},"institutions":[{"id":"https://openalex.org/I169521973","display_name":"University of New Mexico","ror":"https://ror.org/05fs6jp91","country_code":"US","type":"education","lineage":["https://openalex.org/I169521973"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jared Saia","raw_affiliation_strings":["Department of Computer Science, University of New Mexico, Albuquerque, NM, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of New Mexico, Albuquerque, NM, USA","institution_ids":["https://openalex.org/I169521973"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083822059"],"corresponding_institution_ids":["https://openalex.org/I157556583","https://openalex.org/I35440088"],"apc_list":{"value":2490,"currency":"EUR","value_usd":3090},"apc_paid":{"value":2490,"currency":"EUR","value_usd":3090},"fwci":0.4386,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.65122916,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"6","first_page":"489","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/T12288","display_name":"Optimization and Search Problems","score":0.9927999973297119,"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.984499990940094,"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/computer-science","display_name":"Computer science","score":0.6991956233978271},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6372377872467041},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6237719655036926},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.622199296951294},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6012213826179504},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.5266435146331787},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5202628374099731},{"id":"https://openalex.org/keywords/uniform-consensus","display_name":"Uniform consensus","score":0.4686773419380188},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4557667374610901},{"id":"https://openalex.org/keywords/leader-election","display_name":"Leader election","score":0.44062861800193787},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.4348367154598236},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4203418791294098},{"id":"https://openalex.org/keywords/message-switching","display_name":"Message switching","score":0.42023545503616333},{"id":"https://openalex.org/keywords/adversary","display_name":"Adversary","score":0.41939133405685425},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3813561499118805},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.35843726992607117},{"id":"https://openalex.org/keywords/consensus","display_name":"Consensus","score":0.31052839756011963},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.28922387957572937},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2859417796134949},{"id":"https://openalex.org/keywords/message-broker","display_name":"Message broker","score":0.26775360107421875},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2540853023529053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2229483723640442},{"id":"https://openalex.org/keywords/computer-security","display_name":"Computer security","score":0.1557999849319458}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6991956233978271},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6372377872467041},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6237719655036926},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.622199296951294},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6012213826179504},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.5266435146331787},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5202628374099731},{"id":"https://openalex.org/C80966040","wikidata":"https://www.wikidata.org/wiki/Q7885028","display_name":"Uniform consensus","level":4,"score":0.4686773419380188},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4557667374610901},{"id":"https://openalex.org/C53480672","wikidata":"https://www.wikidata.org/wiki/Q1424189","display_name":"Leader election","level":2,"score":0.44062861800193787},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.4348367154598236},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4203418791294098},{"id":"https://openalex.org/C191186522","wikidata":"https://www.wikidata.org/wiki/Q3393411","display_name":"Message switching","level":3,"score":0.42023545503616333},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.41939133405685425},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3813561499118805},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.35843726992607117},{"id":"https://openalex.org/C107107730","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus","level":3,"score":0.31052839756011963},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.28922387957572937},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2859417796134949},{"id":"https://openalex.org/C179733262","wikidata":"https://www.wikidata.org/wiki/Q6821765","display_name":"Message broker","level":2,"score":0.26775360107421875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2540853023529053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2229483723640442},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.1557999849319458},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","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/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00446-017-0315-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00446-017-0315-1","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00446-017-0315-1.pdf","source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"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":"Distributed Computing","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00446-017-0315-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00446-017-0315-1","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00446-017-0315-1.pdf","source":{"id":"https://openalex.org/S139349430","display_name":"Distributed Computing","issn_l":"0178-2770","issn":["0178-2770","1432-0452"],"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":"Distributed Computing","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.5099999904632568}],"awards":[{"id":"https://openalex.org/G1674096151","display_name":null,"funder_award_id":"CCF-1637385","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G1679347402","display_name":null,"funder_award_id":"CCF-1650596","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G499263087","display_name":null,"funder_award_id":"CCR-0313160","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5626068780","display_name":"AF: Small: Algorithms for Active Learning of Interaction Networks","funder_award_id":"0916389","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G567421718","display_name":"EAGER: Concurrent Data Structures","funder_award_id":"1650596","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5938463807","display_name":"AitF: The Fuzzy Log: A Unifying Abstraction for the Theory and Practice of Distributed Systems","funder_award_id":"1637385","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7198297295","display_name":null,"funder_award_id":"644058","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7654345555","display_name":null,"funder_award_id":"CCF-0916389","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7806716297","display_name":"ITR:  Scalable, Attack-Resistant Peer-to-Peer Networks","funder_award_id":"0313160","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G791970913","display_name":null,"funder_award_id":"CAREER Award 0644058","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320315473","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541"},{"id":"https://openalex.org/F4320320924","display_name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","ror":"https://ror.org/00yjd3n13"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W9664036.pdf","grobid_xml":"https://content.openalex.org/works/W9664036.grobid-xml"},"referenced_works_count":37,"referenced_works":["https://openalex.org/W176477096","https://openalex.org/W1505927490","https://openalex.org/W1591056583","https://openalex.org/W1697674579","https://openalex.org/W1967908173","https://openalex.org/W1971406063","https://openalex.org/W1973240854","https://openalex.org/W1976625337","https://openalex.org/W1998351878","https://openalex.org/W1999787317","https://openalex.org/W2003214215","https://openalex.org/W2005317574","https://openalex.org/W2008636585","https://openalex.org/W2034229945","https://openalex.org/W2034325394","https://openalex.org/W2035362408","https://openalex.org/W2037610055","https://openalex.org/W2040993775","https://openalex.org/W2042141409","https://openalex.org/W2047964326","https://openalex.org/W2049066374","https://openalex.org/W2054694168","https://openalex.org/W2062297396","https://openalex.org/W2065180040","https://openalex.org/W2114559692","https://openalex.org/W2126924915","https://openalex.org/W2131848219","https://openalex.org/W2133943294","https://openalex.org/W2147823853","https://openalex.org/W2157268058","https://openalex.org/W2163562577","https://openalex.org/W2168075869","https://openalex.org/W2168550339","https://openalex.org/W2295958421","https://openalex.org/W2401965054","https://openalex.org/W3015241628","https://openalex.org/W3137092842"],"related_works":["https://openalex.org/W4287391350","https://openalex.org/W3120725310","https://openalex.org/W1608733163","https://openalex.org/W2952144494","https://openalex.org/W4301388137","https://openalex.org/W3127062760","https://openalex.org/W2601062540","https://openalex.org/W2108181479","https://openalex.org/W3046827924","https://openalex.org/W9664036"],"abstract_inverted_index":{"We":[0,69,149,289],"consider":[1],"the":[2,7,14,28,31,47,67,103,155,193,230,244,248,259,274,278,294,297,327,331,336],"problem":[3,334],"of":[4,30,112,147,154,161,196,232,250,261,277,296,321],"consensus":[5,74,333],"in":[6,139,202,326,335],"challenging":[8],"classic":[9,332],"model.":[10,339],"In":[11],"this":[12,291],"model,":[13],"adversary":[15],"is":[16,35,41,98,142,180,257,313],"adaptive;":[17],"it":[18,222,312],"can":[19],"choose":[20],"which":[21,141,164],"processors":[22],"crash":[23],"at":[24],"any":[25],"point":[26],"during":[27],"course":[29],"algorithm.":[32],"Further,":[33],"communication":[34],"via":[36],"asynchronous":[37,337],"message":[38,52,78,119],"passing:":[39],"there":[40],"no":[42,127],"known":[43,106,114],"upper":[44],"bound":[45,229],"on":[46,273,304],"time":[48],"to":[49,56,157,181,211,217,240,315],"send":[50,241],"a":[51,71,113,152,183,197,205,300,322],"from":[53],"one":[54],"processor":[55,190,206],"another,":[57],"and":[58,61,108,225,299,325],"all":[59],"messages":[60,138,233],"coin":[62],"flips":[63],"are":[64,264],"seen":[65],"by":[66,95,292],"adversary.":[68],"describe":[70],"new":[72],"randomized":[73],"protocol":[75,123,245],"with":[76],"expected":[77,166],"complexity":[79],"$$O(":[80,132,167],"n^2":[81,117],"\\log":[82,134,172],"^2":[83],"n":[84,89,133,136,168],")$$":[85,118,137,175],"when":[86],"fewer":[87],"than":[88,131],"/":[90],"2":[91],"processes":[92],"may":[93],"fail":[94],"crashing.":[96],"This":[97],"an":[99,158,235,317],"almost-linear":[100],"improvement":[101],"over":[102],"best":[104],"previously":[105],"protocol,":[107,204],"within":[109,144],"logarithmic":[110,145],"factors":[111,146],"$$\\Omega":[115],"(":[116],"lower":[120],"bound.":[121],"The":[122,253],"further":[124],"ensures":[125],"that":[126,234,263,311],"process":[128,237,328],"sends":[129],"more":[130,224,226],"^3":[135],"expectation,":[140],"again":[143],"optimal.":[148],"also":[150],"present":[151],"generalization":[153],"algorithm":[156],"arbitrary":[159],"number":[160,231],"failures":[162],"t,":[163],"uses":[165],"t":[169,174],"+":[170],"t^2":[171],"^{2}":[173],"total":[176],"messages.":[177],"Our":[178],"approach":[179],"build":[182,316],"message-efficient,":[184],"resilient":[185],"mechanism":[186],"for":[187],"aggregating":[188],"individual":[189,236],"votes,":[191],"implementing":[192],"message-passing":[194,319,338],"equivalent":[195],"weak":[198],"shared":[199,279,323],"coin.":[200],"Roughly,":[201],"our":[203],"first":[207],"announces":[208],"its":[209],"votes":[210,262,284],"small":[212],"groups,":[213],"then":[214],"propagates":[215],"them":[216],"increasingly":[218],"larger":[219],"groups":[220],"as":[221],"generates":[223],"votes.":[227,252],"To":[228],"might":[238,285],"have":[239,286],"or":[242],"receive,":[243],"progressively":[246],"increases":[247],"weight":[249],"generated":[251],"main":[254],"technical":[255,301],"challenge":[256],"bounding":[258],"impact":[260],"still":[265],"\u201cin":[266],"flight\u201d":[267],"(generated,":[268],"but":[269],"not":[270],"fully":[271],"propagated)":[272],"final":[275],"outcome":[276],"coin,":[280,324],"especially":[281],"since":[282],"such":[283],"different":[287],"weights.":[288],"achieve":[290],"leveraging":[293],"structure":[295],"algorithm,":[298],"argument":[302],"based":[303],"martingale":[305],"concentration":[306],"bounds.":[307],"Overall,":[308],"we":[309],"show":[310],"possible":[314],"efficient":[318],"implementation":[320],"(almost-optimally)":[329],"solve":[330]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}