Pages that link to "Item:Q5918243"
From MaRDI portal
The following pages link to Faster randomized consensus with an oblivious adversary (Q5918243):
Displaying 8 items.
- 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)
- Randomized consensus with regular registers (Q2059870) (← links)
- A characterization of oblivious message adversaries for which consensus is solvable (Q2345460) (← links)
- Fast randomized consensus using shared memory (Q3485848) (← links)
- Faster randomized consensus with an oblivious adversary (Q5891965) (← links)
- Fast plurality consensus in regular expanders (Q6487484) (← links)
- Consensus with max registers (Q6487518) (← links)