{"id":"https://openalex.org/W4380881694","doi":"https://doi.org/10.1145/3583668.3594599","title":"Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication","display_name":"Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication","publication_year":2023,"publication_date":"2023-06-16","ids":{"openalex":"https://openalex.org/W4380881694","doi":"https://doi.org/10.1145/3583668.3594599"},"language":"en","primary_location":{"id":"doi:10.1145/3583668.3594599","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3583668.3594599","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","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/A5061702545","display_name":"Bogdan S. Chlebus","orcid":"https://orcid.org/0000-0003-4884-941X"},"institutions":[{"id":"https://openalex.org/I25041050","display_name":"Augusta University","ror":"https://ror.org/012mef835","country_code":"US","type":"education","lineage":["https://openalex.org/I25041050"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bogdan Chlebus","raw_affiliation_strings":["Augusta University, Augusta, United States of America"],"raw_orcid":"https://orcid.org/0000-0003-4884-941X","affiliations":[{"raw_affiliation_string":"Augusta University, Augusta, United States of America","institution_ids":["https://openalex.org/I25041050"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101948468","display_name":"Dariusz R. Kowalski","orcid":"https://orcid.org/0000-0002-1316-7788"},"institutions":[{"id":"https://openalex.org/I25041050","display_name":"Augusta University","ror":"https://ror.org/012mef835","country_code":"US","type":"education","lineage":["https://openalex.org/I25041050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dariusz Rafal Kowalski","raw_affiliation_strings":["Augusta University, Augusta, United States of America"],"raw_orcid":"https://orcid.org/0000-0002-1316-7788","affiliations":[{"raw_affiliation_string":"Augusta University, Augusta, United States of America","institution_ids":["https://openalex.org/I25041050"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083806946","display_name":"Jan Olkowski","orcid":"https://orcid.org/0000-0001-9278-3935"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jan Olkowski","raw_affiliation_strings":["University of Maryland, College Park, USA"],"raw_orcid":"https://orcid.org/0000-0001-9278-3935","affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5061702545"],"corresponding_institution_ids":["https://openalex.org/I25041050"],"apc_list":null,"apc_paid":null,"fwci":0.5903,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6743206,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":"31","issue":null,"first_page":"344","last_page":"354"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9904999732971191,"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/T12288","display_name":"Optimization and Search Problems","score":0.9900000095367432,"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/computer-science","display_name":"Computer science","score":0.7122712731361389},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6957831382751465},{"id":"https://openalex.org/keywords/gossip","display_name":"Gossip","score":0.6844391226768494},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.6249822378158569},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.552481472492218},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.529812216758728},{"id":"https://openalex.org/keywords/byzantine-fault-tolerance","display_name":"Byzantine fault tolerance","score":0.5278354287147522},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5037693381309509},{"id":"https://openalex.org/keywords/crash","display_name":"Crash","score":0.4938657879829407},{"id":"https://openalex.org/keywords/consensus","display_name":"Consensus","score":0.48308661580085754},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4698787033557892},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.38782188296318054},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33506011962890625},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30464863777160645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21848273277282715},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.21210578083992004},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.07443967461585999}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7122712731361389},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6957831382751465},{"id":"https://openalex.org/C62989814","wikidata":"https://www.wikidata.org/wiki/Q854648","display_name":"Gossip","level":2,"score":0.6844391226768494},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.6249822378158569},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.552481472492218},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.529812216758728},{"id":"https://openalex.org/C168021876","wikidata":"https://www.wikidata.org/wiki/Q1353446","display_name":"Byzantine fault tolerance","level":3,"score":0.5278354287147522},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5037693381309509},{"id":"https://openalex.org/C183469790","wikidata":"https://www.wikidata.org/wiki/Q333501","display_name":"Crash","level":2,"score":0.4938657879829407},{"id":"https://openalex.org/C107107730","wikidata":"https://www.wikidata.org/wiki/Q2994424","display_name":"Consensus","level":3,"score":0.48308661580085754},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4698787033557892},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.38782188296318054},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33506011962890625},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30464863777160645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21848273277282715},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.21210578083992004},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.07443967461585999},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"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/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3583668.3594599","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1145/3583668.3594599","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6600000262260437,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G827378952","display_name":null,"funder_award_id":"2131538","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W9664036","https://openalex.org/W40658589","https://openalex.org/W388525125","https://openalex.org/W1864882008","https://openalex.org/W1964052655","https://openalex.org/W1974680066","https://openalex.org/W2001271834","https://openalex.org/W2001315747","https://openalex.org/W2006856191","https://openalex.org/W2007754771","https://openalex.org/W2008636585","https://openalex.org/W2017232139","https://openalex.org/W2018047324","https://openalex.org/W2026420798","https://openalex.org/W2029701567","https://openalex.org/W2032783064","https://openalex.org/W2034791526","https://openalex.org/W2037610055","https://openalex.org/W2044833067","https://openalex.org/W2058777482","https://openalex.org/W2077963568","https://openalex.org/W2082078474","https://openalex.org/W2126924915","https://openalex.org/W2128719111","https://openalex.org/W2147567981","https://openalex.org/W2147823853","https://openalex.org/W2159716194","https://openalex.org/W2163324448","https://openalex.org/W2952082721","https://openalex.org/W2962882087","https://openalex.org/W2990270940","https://openalex.org/W3137092842","https://openalex.org/W4250354370","https://openalex.org/W4251986490"],"related_works":["https://openalex.org/W4299315305","https://openalex.org/W2952404855","https://openalex.org/W4319072583","https://openalex.org/W2124134295","https://openalex.org/W4319875884","https://openalex.org/W3006496270","https://openalex.org/W2537685543","https://openalex.org/W2137594557","https://openalex.org/W2899261484","https://openalex.org/W2592592723"],"abstract_inverted_index":{"We":[0,125,158],"develop":[1],"deterministic":[2],"algorithms":[3,171],"for":[4,51,87,96,121,133,148,172],"the":[5,59,68,101,130,137,144,151,167,175],"problems":[6],"of":[7,49,61,70,78,103,146,170,174],"consensus,":[8],"gossiping":[9,97],"and":[10,46,89,98,119,154],"checkpointing":[11],"with":[12,34,65,106],"nodes":[13,71],"prone":[14],"to":[15,40,67,111,128,142],"failing.":[16],"Distributed":[17],"systems":[18],"are":[19,26,80,156],"modeled":[20],"as":[21,29,52,63,141],"synchronous":[22],"complete":[23],"networks.":[24],"Failures":[25],"represented":[27],"either":[28],"crashes":[30],"or":[31],"Byzantine":[32,104],"faults":[33,62,105],"authentication.":[35],"The":[36],"algorithmic":[37],"goal":[38],"is":[39],"have":[41],"both":[42,115,150],"linear":[43,47,116],"running":[44,117,152,168],"time":[45,118,153,169],"amount":[48],"communication":[50,120,155],"large":[53],"an":[54],"upper":[55],"bound":[56,162],"t":[57,81,90,122,147],"on":[58,166],"number":[60,69],"possible,":[64],"respect":[66],"n.":[72],"For":[73,100],"crash":[74,134],"failures,":[75],"these":[76],"bounds":[77],"optimality":[79],"=":[82,91,123],"O(n":[83,92],"/":[84,93],"(log":[85],"n))":[86,95],"consensus":[88,113,131],"(log2":[94],"checkpointing.":[99],"model":[102,139],"authentication,":[107],"we":[108],"show":[109,126],"how":[110,127],"reach":[112],"in":[114,136],"O(\u221an).":[124],"implement":[129],"algorithm":[132],"failures":[135],"single-port":[138],"such":[140],"preserve":[143],"range":[145],"which":[149],"optimal.":[157],"prove":[159],"a":[160],"lower":[161],"\u03a9":[163],"(t+log":[164],"n)":[165],"each":[173],"considered":[176],"problems.":[177]},"counts_by_year":[{"year":2024,"cited_by_count":3}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}