Pages that link to "Item:Q2930301"
From MaRDI portal
The following pages link to Approximate shared-memory counting despite a strong adversary (Q2930301):
Displaying 7 items.
- Combining shared-coin algorithms (Q666060) (← links)
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model (Q1938364) (← links)
- Communication-efficient randomized consensus (Q2075627) (← links)
- The CB tree: a practical concurrent self-adjusting search tree (Q2256968) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q2689836) (← links)
- Lower Bounds for Restricted-Use Objects (Q2812146) (← links)
- Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers (Q3095338) (← links)
