{"id":"https://openalex.org/W4286210088","doi":"https://doi.org/10.1145/3519270.3538471","title":"Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency","display_name":"Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency","publication_year":2022,"publication_date":"2022-07-20","ids":{"openalex":"https://openalex.org/W4286210088","doi":"https://doi.org/10.1145/3519270.3538471"},"language":"en","primary_location":{"id":"doi:10.1145/3519270.3538471","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 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 S. Chlebus","raw_affiliation_strings":["Augusta University, Augusta, GA, USA"],"affiliations":[{"raw_affiliation_string":"Augusta University, Augusta, GA, USA","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 R. Kowalski","raw_affiliation_strings":["Augusta University, Augusta, GA, USA"],"affiliations":[{"raw_affiliation_string":"Augusta University, Augusta, GA, USA","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, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, 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.4144,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61724867,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"106","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"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":1.0,"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.9954000115394592,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9866999983787537,"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.6745458245277405},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.6096435189247131},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6053764820098877},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5772698521614075},{"id":"https://openalex.org/keywords/fault-tolerance","display_name":"Fault tolerance","score":0.548098623752594},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5235971212387085},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5142390131950378},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5046998262405396},{"id":"https://openalex.org/keywords/overlay-network","display_name":"Overlay network","score":0.48497748374938965},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4791657030582428},{"id":"https://openalex.org/keywords/self-stabilization","display_name":"Self-stabilization","score":0.4663386046886444},{"id":"https://openalex.org/keywords/paging","display_name":"Paging","score":0.44082537293434143},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4293258786201477},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.4290805459022522},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.41162562370300293},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36329275369644165},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33246681094169617},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32323384284973145},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28437548875808716},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11684852838516235}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6745458245277405},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.6096435189247131},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6053764820098877},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5772698521614075},{"id":"https://openalex.org/C63540848","wikidata":"https://www.wikidata.org/wiki/Q3140932","display_name":"Fault tolerance","level":2,"score":0.548098623752594},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5235971212387085},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5142390131950378},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5046998262405396},{"id":"https://openalex.org/C169851745","wikidata":"https://www.wikidata.org/wiki/Q1331985","display_name":"Overlay network","level":3,"score":0.48497748374938965},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4791657030582428},{"id":"https://openalex.org/C71112949","wikidata":"https://www.wikidata.org/wiki/Q2873036","display_name":"Self-stabilization","level":3,"score":0.4663386046886444},{"id":"https://openalex.org/C50954386","wikidata":"https://www.wikidata.org/wiki/Q656083","display_name":"Paging","level":2,"score":0.44082537293434143},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4293258786201477},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.4290805459022522},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.41162562370300293},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36329275369644165},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33246681094169617},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32323384284973145},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28437548875808716},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11684852838516235},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3519270.3538471","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519270.3538471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"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/W2006856191","https://openalex.org/W2007754771","https://openalex.org/W2008636585","https://openalex.org/W2018047324","https://openalex.org/W2032783064","https://openalex.org/W2037610055","https://openalex.org/W2044833067","https://openalex.org/W2058777482","https://openalex.org/W2147567981","https://openalex.org/W2163324448","https://openalex.org/W2963714845","https://openalex.org/W4391233898"],"related_works":["https://openalex.org/W4298335201","https://openalex.org/W2950662541","https://openalex.org/W153242498","https://openalex.org/W2810566016","https://openalex.org/W2735706731","https://openalex.org/W4387198001","https://openalex.org/W2013723883","https://openalex.org/W2021142034","https://openalex.org/W2134898865","https://openalex.org/W2115367137"],"abstract_inverted_index":{"We":[0,54,63],"study":[1],"consensus":[2,81,138],"and":[3,18,74,91,123,163,175,187,193],"checkpointing":[4,168],"in":[5,88,134,171],"synchronous":[6],"distributed":[7,78],"systems.":[8],"There":[9],"are":[10,27],"n":[11],"nodes":[12,21,26],"that":[13,65,127,144],"communicate":[14,23],"by":[15,120,190],"sending":[16],"messages,":[17],"any":[19,204],"two":[20],"can":[22,140],"directly.":[24],"The":[25,97,137],"prone":[28],"to":[29,47,72,150],"crashing,":[30],"with":[31,176],"an":[32],"upper":[33],"bound":[34],"t":[35,114],"on":[36,49,117,183],"the":[37,50,100,118,160,184],"number":[38,102],"of":[39,45,52,77,104,113],"crashes.":[40],"Algorithms":[41],"use":[42],"overlay":[43,61],"networks":[44],"choice":[46],"save":[48],"amount":[51],"communication.":[53],"explore":[55],"using":[56],"Ramanujan":[57,66],"graphs":[58,67],"as":[59],"such":[60,143],"networks.":[62],"demonstrate":[64],"have":[68,199],"topological":[69],"properties":[70],"conducive":[71],"fault-tolerance":[73],"time/communication":[75],"efficiency":[76],"algorithms.":[79],"Our":[80,167],"algorithm":[82,98,119,139,169,189],"assumes":[83],"binary":[84],"input":[85],"values,":[86],"runs":[87,170],"O(t)":[89],"time":[90,162,173],"sends":[92,99,129,147],"O(n+t":[93],"log":[94],"t)":[95],"bits.":[96],"optimum":[101],"O(n)":[103,130,174],"bits":[105,131],"for":[106,110,203],"t=O(n/log":[107],"n),":[108],"thus":[109],"this":[111],"range":[112],"it":[115],"improves":[116,182],"Galil,":[121,191],"Mayer":[122,192],"Yung":[124,194],"[FOCS":[125,195],"1995]":[126],"also":[128],"but":[132],"works":[133],"exponential":[135],"time.":[136],"be":[141],"implemented":[142],"a":[145,148,156],"node":[146,154],"message":[149],"at":[151,155],"most":[152,185],"one":[153],"round":[157],"while":[158],"maintaining":[159],"asymptotic":[161],"communication":[164],"performance":[165],"bounds.":[166],"linear":[172],"O(n":[177],"log7":[178],"n)":[179],"messages.":[180],"It":[181],"communication-efficient":[186],"time-optimal":[188],"1995],":[196],"which":[197],"may":[198],"O(n1+\u03b5)":[200],"messages":[201],"sent,":[202],"chosen":[205],"constant":[206],"\u03b5>0.":[207]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}