Pages that link to "Item:Q5419107"
From MaRDI portal
The following pages link to Linearizable implementations do not suffice for randomized distributed computation (Q5419107):
Displaying 7 items.
- Randomized mutual exclusion with sub-logarithmic RMR-complexity (Q661045) (← links)
- The correctness proof of Ben-Or's randomized consensus algorithm (Q1938380) (← links)
- Randomized consensus with regular registers (Q2059870) (← links)
- On atomic registers and randomized consensus in m\&m systems (Q2121060) (← links)
- Sub-logarithmic Test-and-Set against a Weak Adversary (Q3095319) (← links)
- Tight Bounds for Asynchronous Renaming (Q3189653) (← links)
- Faster randomized consensus with an oblivious adversary (Q5918243) (← links)
