{"id":"https://openalex.org/W2114856692","doi":"https://doi.org/10.1145/1993806.1993809","title":"Error-free multi-valued consensus with byzantine failures","display_name":"Error-free multi-valued consensus with byzantine failures","publication_year":2011,"publication_date":"2011-06-06","ids":{"openalex":"https://openalex.org/W2114856692","doi":"https://doi.org/10.1145/1993806.1993809","mag":"2114856692"},"language":"en","primary_location":{"id":"doi:10.1145/1993806.1993809","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993806.1993809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing","raw_type":"proceedings-article"},"type":"conference-paper","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/A5101055719","display_name":"Guanfeng Liang","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Guanfeng Liang","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Urbana, IL, USA","University of Illinois at Urbana/Champaign, Urbana, IL, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana/Champaign, Urbana, IL, USA#TAB#","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042521435","display_name":"Nitin H. Vaidya","orcid":"https://orcid.org/0000-0001-5104-8977"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nitin Vaidya","raw_affiliation_strings":["University of Illinois at Urbana-Champaign, Urbana, IL, USA","University of Illinois at Urbana/Champaign, Urbana, IL, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana-Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana/Champaign, Urbana, IL, USA#TAB#","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"20"},"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.9994999766349792,"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.9994999766349792,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9937999844551086,"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/T12149","display_name":"Nanocluster Synthesis and Applications","score":0.9915000200271606,"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.7597180604934692},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.6217216849327087},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46787306666374207},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4416344463825226},{"id":"https://openalex.org/keywords/consensus-algorithm","display_name":"Consensus algorithm","score":0.4406229853630066},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.43980443477630615},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4344903528690338},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4259582459926605},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3607558012008667},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2968849539756775},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.15392038226127625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14784005284309387}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7597180604934692},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.6217216849327087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46787306666374207},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4416344463825226},{"id":"https://openalex.org/C2983222225","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus algorithm","level":2,"score":0.4406229853630066},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.43980443477630615},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4344903528690338},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4259582459926605},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3607558012008667},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2968849539756775},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.15392038226127625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14784005284309387},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1993806.1993809","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1993806.1993809","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.743.9743","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.743.9743","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1101.3520.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W48039395","https://openalex.org/W159543160","https://openalex.org/W188189722","https://openalex.org/W785083160","https://openalex.org/W1487579480","https://openalex.org/W1533432398","https://openalex.org/W1576568683","https://openalex.org/W1835598050","https://openalex.org/W1967345158","https://openalex.org/W1968010535","https://openalex.org/W1978370567","https://openalex.org/W2002501531","https://openalex.org/W2034791526","https://openalex.org/W2037529689","https://openalex.org/W2077963568","https://openalex.org/W2083270107","https://openalex.org/W2110251422","https://openalex.org/W2126924915","https://openalex.org/W2135912262","https://openalex.org/W2136237463","https://openalex.org/W2149408263","https://openalex.org/W2171846787","https://openalex.org/W2171958038","https://openalex.org/W2949506230","https://openalex.org/W2952082721","https://openalex.org/W3137092842","https://openalex.org/W4226079542","https://openalex.org/W6622506867","https://openalex.org/W6638768123"],"related_works":["https://openalex.org/W4400410098","https://openalex.org/W3194244590","https://openalex.org/W3210065602","https://openalex.org/W3132443168","https://openalex.org/W4200413673","https://openalex.org/W4366607545","https://openalex.org/W4313015754","https://openalex.org/W4313890288","https://openalex.org/W3088605168","https://openalex.org/W4388228623"],"abstract_inverted_index":{"In":[0],"this":[1,70],"paper,":[2],"we":[3],"present":[4],"an":[5,21,185],"efficient":[6,104],"deterministic":[7],"algorithm":[8,17,58,73,139,147,153,204],"for":[9,164],"consensus":[10,19,75,88],"in":[11,33,63,82],"presence":[12],"of":[13,37,55,66,92,99,109,131,145,161,175,184,198],"Byzantine":[14,44],"failures.":[15],"Our":[16],"achieves":[18],"on":[20,76,89,120],"L-bit":[22],"value":[23],"with":[24,40,195],"communication":[25,53,169,189],"complexity":[26,54],"O(nL":[27],"+":[28,30],"n4L0.5":[29],"n6)":[31],"bits,":[32,61],"a":[34,77,90,107,158,172,182],"network":[35],"consisting":[36],"n":[38],"processors":[39],"up":[41],"to":[42,156],"t":[43],"failures,":[45],"such":[46],"that":[47,142],"t<n/3.":[48],"For":[49],"large":[50,159],"enough":[51],"L,":[52],"the":[56,64,72,93,126,135,138,146,176,188,196,199],"proposed":[57,124,203],"becomes":[59],"O(nL)":[60],"linear":[62,168],"number":[65],"processors.":[67,127],"To":[68],"achieve":[69,157],"goal,":[71],"performs":[74],"long":[78],"message":[79],"(L":[80],"bits),":[81],"multiple":[83],"generations,":[84,137],"each":[85,100],"generation":[86,101],"performing":[87],"part":[91],"input":[94,122],"message.":[95],"The":[96,202],"failure-free":[97],"execution":[98],"is":[102,154],"made":[103],"by":[105,125],"using":[106,181],"combination":[108],"two":[110],"techniques:":[111],"error":[112,177],"detection":[113,178],"coding,":[114],"and":[115,180],"processor":[116],"clique":[117,183],"formation":[118],"based":[119],"matching":[121],"values":[123],"By":[128],"keeping":[129],"track":[130],"faulty":[132],"behavior":[133],"over":[134],"different":[136],"can":[140,191],"ensure":[141],"most":[143],"generations":[144],"are":[148],"failure-free.":[149],"With":[150,171],"parameterization,":[151],"our":[152],"able":[155],"class":[160],"validity":[162,200],"conditions":[163],"consensus,":[165],"while":[166],"maintaining":[167],"complexity.":[170],"suitable":[173],"choice":[174],"code,":[179],"appropriate":[186],"size,":[187],"cost":[190],"be":[192],"traded":[193],"off":[194],"strength":[197],"condition.":[201],"requires":[205],"no":[206],"cryptographic":[207],"techniques.":[208]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":5}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}