A new deterministic fault-tolerant local load-balancing algorithm is used to obtain consensus protocols with near-optimal communication and time against adaptive crash and omission failures.
A tight lower bound for randomized synchronous consensus
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DC 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries
A new deterministic fault-tolerant local load-balancing algorithm is used to obtain consensus protocols with near-optimal communication and time against adaptive crash and omission failures.