Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing 2022
DOI: 10.1145/3519270.3538471
|View full text |Cite
|
Sign up to set email alerts
|

Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…There are a number of solutions optimizing consensus in incomplete topologies [2,6,17,23,24]. Chlebus et al [6] optimize the speed of achieving Byzantine consensus in arbitrary topologies. The connectivity is subject to 2f +1 bound.…”
Section: Introductionmentioning
confidence: 99%
“…There are a number of solutions optimizing consensus in incomplete topologies [2,6,17,23,24]. Chlebus et al [6] optimize the speed of achieving Byzantine consensus in arbitrary topologies. The connectivity is subject to 2f +1 bound.…”
Section: Introductionmentioning
confidence: 99%