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

A topological perspective on distributed network algorithms., , , , , and . Theor. Comput. Sci., (2021)Asynchronous Agreement and Its Relation with Error-Correcting Codes., , , and . IEEE Trans. Computers, 56 (7): 865-875 (2007)A Flexible Simulator for Distributed Algorithms., , and . ENC, page 176-181. IEEE Computer Society, (2003)Agreement via Symmetry Breaking: On the Structure of Weak Subconsensus Tasks., , and . IPDPS, page 1147-1158. IEEE Computer Society, (2013)On the performance of distributed networks controlled by a simple synchronizer.. Technion - Israel Institute of Technology, Israel, (1990)A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus., , , and . SSS, volume 11914 of Lecture Notes in Computer Science, page 307-322. Springer, (2019)Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses|., , , and . NETYS, volume 7853 of Lecture Notes in Computer Science, page 28-41. Springer, (2013)A hierarchy of conditions for consensus solvability., , , and . PODC, page 151-160. ACM, (2001)Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer., and . Math. Syst. Theory, 28 (5): 421-435 (1995)Cycle-pancyclism in tournaments II., and . Graphs Comb., 12 (1): 9-16 (1996)