{"id":"https://openalex.org/W1543193821","doi":"https://doi.org/10.1109/reldis.2002.1180170","title":"Tolerance to unbounded Byzantine faults","display_name":"Tolerance to unbounded Byzantine faults","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W1543193821","doi":"https://doi.org/10.1109/reldis.2002.1180170","mag":"1543193821"},"language":"en","primary_location":{"id":"doi:10.1109/reldis.2002.1180170","is_oa":false,"landing_page_url":"https://doi.org/10.1109/reldis.2002.1180170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings.","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/A5109248116","display_name":"Mikhail Nesterenko","orcid":null},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"M. Nesterenko","raw_affiliation_strings":["Department of Computer Science, Kent University, Kent, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Kent University, Kent, OH, USA","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5112312077","display_name":"Anita Arora","orcid":"https://orcid.org/0009-0006-5800-1198"},"institutions":[{"id":"https://openalex.org/I52357470","display_name":"The Ohio State University","ror":"https://ror.org/00rs6vg23","country_code":"US","type":"education","lineage":["https://openalex.org/I52357470"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Arora","raw_affiliation_strings":["Department of Computer and Information Science, Ohio State Uinversity, Columbus, OH, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer and Information Science, Ohio State Uinversity, Columbus, OH, USA","institution_ids":["https://openalex.org/I52357470"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5109248116"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":null,"apc_paid":null,"fwci":4.4643,"has_fulltext":false,"cited_by_count":76,"citation_normalized_percentile":{"value":0.95004583,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"22","last_page":"29"},"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.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/T13553","display_name":"Age of Information Optimization","score":0.9894999861717224,"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/locality","display_name":"Locality","score":0.776032567024231},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6521819233894348},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.6418381333351135},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6238330602645874},{"id":"https://openalex.org/keywords/impossibility","display_name":"Impossibility","score":0.621427595615387},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.5495584607124329},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5372540354728699},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.49846506118774414},{"id":"https://openalex.org/keywords/quantum-byzantine-agreement","display_name":"Quantum Byzantine agreement","score":0.47087109088897705},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.46551135182380676},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.43022167682647705},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4117829203605652},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3468437194824219},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25174397230148315},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24959459900856018}],"concepts":[{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.776032567024231},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6521819233894348},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.6418381333351135},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6238330602645874},{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.621427595615387},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.5495584607124329},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5372540354728699},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.49846506118774414},{"id":"https://openalex.org/C17532199","wikidata":"https://www.wikidata.org/wiki/Q17083590","display_name":"Quantum Byzantine agreement","level":4,"score":0.47087109088897705},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.46551135182380676},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.43022167682647705},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4117829203605652},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3468437194824219},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25174397230148315},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24959459900856018},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/reldis.2002.1180170","is_oa":false,"landing_page_url":"https://doi.org/10.1109/reldis.2002.1180170","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W4359858","https://openalex.org/W1487757394","https://openalex.org/W1533056435","https://openalex.org/W1540937761","https://openalex.org/W1543193821","https://openalex.org/W1872485055","https://openalex.org/W1966207486","https://openalex.org/W1981758545","https://openalex.org/W2031447444","https://openalex.org/W2031556125","https://openalex.org/W2036135294","https://openalex.org/W2056027311","https://openalex.org/W2062007799","https://openalex.org/W2095425626","https://openalex.org/W2104532741","https://openalex.org/W2116314988","https://openalex.org/W2146824642","https://openalex.org/W2162250318","https://openalex.org/W2165810979","https://openalex.org/W3137092842","https://openalex.org/W4234195051","https://openalex.org/W6600153817","https://openalex.org/W6641812597","https://openalex.org/W6665760482"],"related_works":["https://openalex.org/W1698117324","https://openalex.org/W2292106967","https://openalex.org/W4290996430","https://openalex.org/W2109232026","https://openalex.org/W4210453042","https://openalex.org/W2997526278","https://openalex.org/W2775054947","https://openalex.org/W2146384899","https://openalex.org/W603186994","https://openalex.org/W2145120192"],"abstract_inverted_index":{"An":[0],"ideal":[1],"approach":[2,38],"to":[3,12,24,70],"deal":[4],"with":[5,68,98],"faults":[6,17,42,72,147],"in":[7,53,82,85],"large-scale":[8],"distributed":[9,128],"systems":[10],"is":[11,51,107,117],"contain":[13],"the":[14,101,127,145,157],"effects":[15],"of":[16,28,65,103,111,126,152,159],"as":[18,20,44,74,142,144],"locally":[19],"possible":[21],"and,":[22],"additionally,":[23],"ensure":[25],"some":[26],"type":[27,110],"tolerance":[29,67,105,112],"within":[30,114],"each":[31,130],"fault-affected":[32,115],"locality.":[33],"Existing":[34],"results":[35,89],"using":[36],"this":[37,58,160],"accommodate":[39],"only":[40,146],"limited":[41],"(such":[43,73],"crashes)":[45],"or":[46],"assume":[47],"that":[48,100,148],"fault":[49],"occurrence":[50,78],"bounded":[52],"space":[54,83],"and/or":[55],"time.":[56,86],"In":[57],"paper,":[59],"we":[60],"define":[61],"and":[62,84,95],"explore":[63],"possibility/impossibility":[64],"local":[66],"respect":[69],"arbitrary":[71,124],"Byzantine":[75],"faults)":[76],"whose":[77],"may":[79],"be":[80],"unbounded":[81],"Our":[87],"positive":[88],"include":[90],"programs":[91],"for":[92],"graph":[93],"coloring":[94],"dining":[96],"philosophers,":[97],"proofs":[99],"size":[102],"their":[104,153],"locality":[106,158],"optimal.":[108],"The":[109],"achieved":[113],"localities":[116],"self-stabilization.":[118],"That":[119],"is,":[120],"starting":[121],"from":[122,137],"an":[123],"state":[125,136],"system,":[129],"non-faulty":[131],"process":[132],"eventually":[133],"reaches":[134],"a":[135],"where":[138],"it":[139],"behaves":[140],"correctly":[141],"long":[143],"occur":[149],"henceforth":[150],"(regardless":[151],"number)":[154],"are":[155],"outside":[156],"process.":[161]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}