149
click to vote
SPAA
2010
ACM
16 years 2 days ago
2010
ACM
This paper presents wait-free randomized algorithms for solving set-agreement in asynchronous shared-memory systems under a strong adversary. First, the definition of a shared-co...