{"id":"https://openalex.org/W4406085360","doi":"https://doi.org/10.3390/a18010026","title":"Impossibility Results for Byzantine-Tolerant State Observation, Synchronization, and Graph Computation Problems","display_name":"Impossibility Results for Byzantine-Tolerant State Observation, Synchronization, and Graph Computation Problems","publication_year":2025,"publication_date":"2025-01-05","ids":{"openalex":"https://openalex.org/W4406085360","doi":"https://doi.org/10.3390/a18010026"},"language":"en","primary_location":{"id":"doi:10.3390/a18010026","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18010026","pdf_url":"https://www.mdpi.com/1999-4893/18/1/26/pdf?version=1736146962","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/18/1/26/pdf?version=1736146962","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030287525","display_name":"Ajay D. Kshemkalyani","orcid":"https://orcid.org/0000-0003-2451-7306"},"institutions":[{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ajay Kshemkalyani","raw_affiliation_strings":["Department of Computer Science, University of Illinois Chicago, Chicago, IL 60607, USA"],"raw_orcid":"https://orcid.org/0000-0003-2451-7306","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois Chicago, Chicago, IL 60607, USA","institution_ids":["https://openalex.org/I39422238"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085445003","display_name":"Anshuman Misra","orcid":"https://orcid.org/0000-0003-3987-7945"},"institutions":[{"id":"https://openalex.org/I4210130184","display_name":"Purdue University Fort Wayne","ror":"https://ror.org/04c4hz115","country_code":"US","type":"education","lineage":["https://openalex.org/I4210130184"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anshuman Misra","raw_affiliation_strings":["Department of Computer Science, Purdue University Fort Wayne, Fort Wayne, IN 46805, USA"],"raw_orcid":"https://orcid.org/0000-0003-3987-7945","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University Fort Wayne, Fort Wayne, IN 46805, USA","institution_ids":["https://openalex.org/I4210130184"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5030287525"],"corresponding_institution_ids":["https://openalex.org/I39422238"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":1.197,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.76178036,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"18","issue":"1","first_page":"26","last_page":"26"},"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/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9871000051498413,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9772999882698059,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/impossibility","display_name":"Impossibility","score":0.8613923192024231},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6848058700561523},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6217519640922546},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.6165169477462769},{"id":"https://openalex.org/keywords/byzantine-architecture","display_name":"Byzantine architecture","score":0.5890343189239502},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5860597491264343},{"id":"https://openalex.org/keywords/quantum-byzantine-agreement","display_name":"Quantum Byzantine agreement","score":0.5365960597991943},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.4503244459629059},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.42434561252593994},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.41159650683403015},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.31441551446914673},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2166195809841156},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16731378436088562},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.1488388478755951}],"concepts":[{"id":"https://openalex.org/C2776261394","wikidata":"https://www.wikidata.org/wiki/Q315562","display_name":"Impossibility","level":2,"score":0.8613923192024231},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6848058700561523},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6217519640922546},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.6165169477462769},{"id":"https://openalex.org/C104562893","wikidata":"https://www.wikidata.org/wiki/Q47591","display_name":"Byzantine architecture","level":2,"score":0.5890343189239502},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5860597491264343},{"id":"https://openalex.org/C17532199","wikidata":"https://www.wikidata.org/wiki/Q17083590","display_name":"Quantum Byzantine agreement","level":4,"score":0.5365960597991943},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.4503244459629059},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.42434561252593994},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41159650683403015},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.31441551446914673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2166195809841156},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16731378436088562},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.1488388478755951},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C195244886","wikidata":"https://www.wikidata.org/wiki/Q41493","display_name":"Ancient history","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},{"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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3390/a18010026","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18010026","pdf_url":"https://www.mdpi.com/1999-4893/18/1/26/pdf?version=1736146962","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:203212ea3a4847ca856b21afee3f139a","is_oa":true,"landing_page_url":"https://doaj.org/article/203212ea3a4847ca856b21afee3f139a","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 18, Iss 1, p 26 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.3390/a18010026","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a18010026","pdf_url":"https://www.mdpi.com/1999-4893/18/1/26/pdf?version=1736146962","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","score":0.8100000023841858,"display_name":"Reduced inequalities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4406085360.pdf","grobid_xml":"https://content.openalex.org/works/W4406085360.grobid-xml"},"referenced_works_count":18,"referenced_works":["https://openalex.org/W564832898","https://openalex.org/W1652742168","https://openalex.org/W1981173460","https://openalex.org/W2003214215","https://openalex.org/W2035362408","https://openalex.org/W2038924034","https://openalex.org/W2052990370","https://openalex.org/W2084316739","https://openalex.org/W2109691981","https://openalex.org/W3137092842","https://openalex.org/W3137220996","https://openalex.org/W4299514705","https://openalex.org/W4312508832","https://openalex.org/W4313463163","https://openalex.org/W4316660055","https://openalex.org/W4391992401","https://openalex.org/W6847772188","https://openalex.org/W6851122595"],"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/W2126087831"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,15,26,76,91],"solvability":[4],"of":[5,17,78],"several":[6],"fundamental":[7,81],"problems":[8,24,82],"in":[9,14,102],"asynchronous":[10,103],"message-passing":[11,104],"distributed":[12,21,59,105],"systems":[13],"presence":[16],"Byzantine":[18],"processes":[19],"using":[20],"algorithms.":[22],"These":[23],"are":[25],"following:":[27],"mutual":[28],"exclusion,":[29],"global":[30],"snapshot":[31],"recording,":[32],"termination":[33],"detection,":[34,36,38],"deadlock":[35],"predicate":[37],"causal":[39],"ordering,":[40],"spanning":[41,45],"tree":[42,46],"construction,":[43,47],"minimum":[44],"all\u2013all":[48],"shortest":[49],"paths":[50],"computation,":[51],"and":[52,70],"maximal":[53],"independent":[54],"set":[55],"computation.":[56],"In":[57],"a":[58,88],"algorithm,":[60],"each":[61],"process":[62],"has":[63,96],"access":[64],"only":[65],"to":[66,90,99],"its":[67],"local":[68],"variables":[69],"incident":[71],"edge":[72],"parameters.":[73],"We":[74],"show":[75],"impossibility":[77],"solving":[79],"these":[80],"by":[83],"proving":[84],"that":[85],"they":[86],"require":[87],"solution":[89],"causality":[92],"determination":[93],"problem":[94],"which":[95],"been":[97],"shown":[98],"be":[100],"unsolvable":[101],"systems.":[106]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}