Pages that link to "Item:Q5361484"
From MaRDI portal
The following pages link to Efficient asynchronous consensus with the weak adversary scheduler (Q5361484):
Displaying 9 items.
- Tight bounds for adopt-commit objects (Q487260) (← links)
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model (Q1938364) (← links)
- Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler (Q1953239) (← links)
- On the importance of having an identity or, is consensus really universal? (Q1953645) (← links)
- Sub-logarithmic Test-and-Set against a Weak Adversary (Q3095319) (← links)
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study (Q5137903) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Randomized protocols for asynchronous consensus (Q5138489) (← links)
- Faster randomized consensus with an oblivious adversary (Q5918243) (← links)