Author of the publication

Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks.

, , , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 145-156. Springer, (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Unifying Concurrent Objects and Distributed Tasks: Interval-Linearizability., , and . J. ACM, 65 (6): 45:1-45:42 (2018)On the Average Performance of Synchronized Programs in Distributed Networks (Preliminary Version)., and . WDAG, volume 486 of Lecture Notes in Computer Science, page 102-121. Springer, (1990)The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract)., and . WDAG, volume 1151 of Lecture Notes in Computer Science, page 322-343. Springer, (1996)Distributed Algorithms for Minimum Spanning Trees.. Encyclopedia of Algorithms, Springer, (2008)Collapsibility of read/write models using discrete morse theory., and . J. Appl. Comput. Topol., 1 (3-4): 365-396 (2018)An Equivariance Theorem with Applications to Renaming., , and . LATIN, volume 7256 of Lecture Notes in Computer Science, page 133-144. Springer, (2012)Iterated Shared Memory Models.. LATIN, volume 6034 of Lecture Notes in Computer Science, page 407-416. Springer, (2010)Stability of Multivalued Continuous Consensus., , and . SIAM J. Comput., 37 (4): 1057-1076 (2007)A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring., , and . J. Appl. Comput. Topol., 4 (1): 141-179 (2020)The topology of look-compute-move robot wait-free algorithms with hard termination., , , and . Distributed Comput., 32 (3): 235-255 (2019)