| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4952055 | Theoretical Computer Science | 2017 | 21 Pages |
Abstract
Finally, the paper studies a link between the solvability of d-set agreement and (d,ϵ)-solo approximate agreement in asynchronous wait-free message-passing systems, which provides an insight on the “maximal partitioning” allowed to solve an approximate agreement task.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Maurice Herlihy, Sergio Rajsbaum, Michel Raynal, Julien Stainer,