Pages that link to "Item:Q1008730"
From MaRDI portal
The following pages link to From adaptive renaming to set agreement (Q1008730):
Displaying 9 items.
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- A note on atomicity: boosting Test\&Set to solve consensus (Q987831) (← links)
- New combinatorial topology bounds for renaming: the lower bound (Q992504) (← links)
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers (Q1741965) (← links)
- Renaming and the weakest family of failure detectors (Q1938384) (← links)
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects (Q2802146) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- Oblivious Collaboration (Q3095350) (← links)
- From Renaming to Set Agreement (Q5425961) (← links)