Pages that link to "Item:Q3766835"
From MaRDI portal
The following pages link to Impossibility of distributed consensus with one faulty process (Q3766835):
Displaying 6 items.
- Minimal counterexamples for linear-time probabilistic verification (Q402125) (← links)
- Using asynchrony and zero degradation to speed up indulgent consensus protocols (Q436832) (← links)
- Low complexity Byzantine-resilient consensus (Q1953244) (← links)
- Tight bounds for shared memory systems accessed by Byzantine processes (Q1953641) (← links)
- Communication-efficient randomized consensus (Q2075627) (← links)
- Generalized Paxos made Byzantine (and less complex) (Q2633262) (← links)
