Cutoff bounds for consensus algorithms
From MaRDI portal
Recommendations
- Tight bounds for asymptotic and approximate consensus
- Tight Bounds for Asymptotic and Approximate Consensus
- Consensus Algorithms and the Decomposition-Separation Theorem
- Combinatorial Pattern Matching
- Tight bound for deciding convergence of consensus systems
- Tight bounds for asynchronous randomized consensus
- Tight bounds for asynchronous randomized consensus
- Consensus-halving via theorems of Borsuk-Ulam and Tucker
- scientific article; zbMATH DE number 1950667
- Lower bounds for asynchronous consensus
Cited in
(13)- A bivalency proof of the lower bound for uniform consensus
- MinMax algorithms for stabilizing consensus
- Higher-order quantifier elimination, counter simulations and fault-tolerant systems
- Finding cut-offs in leaderless rendez-vous protocols is easy
- Eliminating message counters in synchronous threshold automata
- A logic-based framework for verifying consensus algorithms
- Synthesis of distributed algorithms with parameterized threshold guards
- Reachability in parameterized systems: all flavors of threshold automata
- Derivation of heard-of predicates from elementary behavioral patterns
- Characterizing Consensus in the Heard-Of Model
- scientific article; zbMATH DE number 7407798 (Why is no real title available?)
- A case study on parametric verification of failure detectors
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker
This page was built for publication: Cutoff bounds for consensus algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2164223)
