Abstract
We consider the the relative power of two important synchronization problems: set agreement and renaming. We show that renaming is strictly weaker than set agreement, in a round-by-round model of computation. We introduce new techniques, including previously unknown connections between properties of manifolds and computation, as well as novel "symmetry-breaking" constructions. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Gafni, E., Rajsbaum, S., & Herlihy, M. (2006). Subconsensus tasks: Renaming is weaker than set agreement. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4167 LNCS, pp. 329–338). Springer Verlag. https://doi.org/10.1007/11864219_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
