The following pages link to From Renaming to Set Agreement (Q5425961):
Displaying 6 items.
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- From adaptive renaming to set agreement (Q1008730) (← 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)
- Adaptive and efficient algorithms for lattice agreement and renaming (Q2784474) (← links)
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers (Q5363809) (← links)
