{"id":"https://openalex.org/W4399523404","doi":"https://doi.org/10.1145/3618260.3649736","title":"Optimal Load-Balanced Scalable Distributed Agreement","display_name":"Optimal Load-Balanced Scalable Distributed Agreement","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4399523404","doi":"https://doi.org/10.1145/3618260.3649736"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649736","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649736","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649736","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649736","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050060668","display_name":"Yuval Gelles","orcid":"https://orcid.org/0000-0003-0405-9651"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yuval Gelles","raw_affiliation_strings":["Hebrew University, Jerusalem, Israel"],"raw_orcid":"https://orcid.org/0000-0003-0405-9651","affiliations":[{"raw_affiliation_string":"Hebrew University, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032483797","display_name":"Ilan Komargodski","orcid":"https://orcid.org/0000-0002-1647-2112"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilan Komargodski","raw_affiliation_strings":["Hebrew University, Jerusalem, Israel / NTT Research, Sunnyvale, USA"],"raw_orcid":"https://orcid.org/0000-0002-1647-2112","affiliations":[{"raw_affiliation_string":"Hebrew University, Jerusalem, Israel / NTT Research, Sunnyvale, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"411","last_page":"422"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9984999895095825,"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/T12149","display_name":"Nanocluster Synthesis and Applications","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials 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.7809737324714661},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7454134225845337},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.7156224250793457},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6819713115692139},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.6655175685882568},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6134341955184937},{"id":"https://openalex.org/keywords/quantum-byzantine-agreement","display_name":"Quantum Byzantine agreement","score":0.5354748964309692},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.527251124382019},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.523621141910553},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5059120059013367},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4933995306491852},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.485797643661499},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4745500981807709},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.46014201641082764},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.45073404908180237},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2914294898509979},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22240793704986572},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1880851686000824},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.15280160307884216}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7809737324714661},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7454134225845337},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.7156224250793457},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6819713115692139},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.6655175685882568},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6134341955184937},{"id":"https://openalex.org/C17532199","wikidata":"https://www.wikidata.org/wiki/Q17083590","display_name":"Quantum Byzantine agreement","level":4,"score":0.5354748964309692},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.527251124382019},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.523621141910553},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5059120059013367},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4933995306491852},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.485797643661499},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4745500981807709},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.46014201641082764},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.45073404908180237},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2914294898509979},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22240793704986572},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1880851686000824},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.15280160307884216},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3618260.3649736","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649736","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649736","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649736","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649736","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649736","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4399523404.pdf"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W48039395","https://openalex.org/W97265488","https://openalex.org/W1528693676","https://openalex.org/W1562783580","https://openalex.org/W1574373886","https://openalex.org/W1760381732","https://openalex.org/W1971817342","https://openalex.org/W1987161563","https://openalex.org/W2001271834","https://openalex.org/W2003214215","https://openalex.org/W2034109654","https://openalex.org/W2034791526","https://openalex.org/W2082257278","https://openalex.org/W2090418561","https://openalex.org/W2126087831","https://openalex.org/W2126924915","https://openalex.org/W2127212631","https://openalex.org/W2133382302","https://openalex.org/W2139964991","https://openalex.org/W2405322972","https://openalex.org/W2495326230","https://openalex.org/W2567427072","https://openalex.org/W2763398287","https://openalex.org/W2810304253","https://openalex.org/W2884909828","https://openalex.org/W2914554654","https://openalex.org/W2962882087","https://openalex.org/W3137092842","https://openalex.org/W4213146104","https://openalex.org/W4235450291","https://openalex.org/W4248885329","https://openalex.org/W4399523404","https://openalex.org/W6966280974"],"related_works":["https://openalex.org/W1698117324","https://openalex.org/W2292106967","https://openalex.org/W4290996430","https://openalex.org/W4210453042","https://openalex.org/W2997526278","https://openalex.org/W2109232026","https://openalex.org/W2775054947","https://openalex.org/W2146384899","https://openalex.org/W603186994","https://openalex.org/W2126087831"],"abstract_inverted_index":{"We":[0,146],"consider":[1,24],"the":[2,15,43,61,71,79,117,125,133,140,169,172,175],"fundamental":[3],"problem":[4],"of":[5,17,54,64,78,97,108,171,180],"designing":[6],"classical":[7],"consensus-related":[8],"distributed":[9],"abstractions":[10],"for":[11,76,103,112,124],"large-scale":[12],"networks,":[13],"where":[14],"number":[16,53,63],"parties":[18],"can":[19],"be":[20],"huge.":[21],"Specifically,":[22],"we":[23,69],"tasks":[25,128],"such":[26,73],"as":[27],"Byzantine":[28,158],"Agreement,":[29],"Broadcast,":[30],"and":[31,34,50,88,99,183],"Committee":[32],"Election,":[33],"our":[35,83,148,166],"goal":[36],"is":[37,57,101],"to":[38],"design":[39],"scalable":[40,74],"protocols":[41,75,123],"in":[42,59,165],"sense":[44],"that":[45,156],"each":[46,85],"honest":[47],"party":[48,86],"processes":[49,87],"sends":[51,89],"a":[52,151],"bits":[55,92],"which":[56],"sub-linear":[58],"n,":[60],"total":[62],"parties.":[65],"In":[66,82],"this":[67],"work,":[68],"construct":[70],"first":[72],"all":[77],"above":[80],"tasks.":[81],"protocols,":[84],"\u00d5":[90,94],"(\u221an)":[91],"throughout":[93],"(1)":[95],"rounds":[96],"communication,":[98],"correctness":[100],"guaranteed":[102],"at":[104],"most":[105],"1/3\u2212\u0454":[106],"fraction":[107],"static":[109],"byzantine":[110],"corruptions":[111],"every":[113],"constant":[114],"\u0454>0":[115],"(in":[116],"full":[118],"information":[119],"model).":[120],"All":[121],"previous":[122],"considered":[126],"agreement":[127],"were":[129],"non-scalable,":[130],"either":[131],"because":[132,139],"communication":[134],"complexity":[135,142,164],"was":[136,143,174],"linear":[137],"or":[138],"computational":[141],"super":[144],"polynomial.":[145],"complement":[147],"result":[149],"with":[150],"matching":[152],"lower":[153,178],"bound":[154,179],"showing":[155],"any":[157],"Agreement":[159],"protocol":[160],"must":[161],"have":[162],"\u03a9(\u221an)":[163],"model.":[167],"Previously,":[168],"state":[170],"art":[173],"well-known":[176],"\u03a9(\u221bn)":[177],"Holtby,":[181],"Kapron,":[182],"King":[184],"(Distributed":[185],"Computing,":[186],"2008).":[187]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}