Author of the publication

Making Local Algorithms Wait-Free: The Case of Ring Coloring.

, , , , and . SSS, volume 10083 of Lecture Notes in Computer Science, page 109-125. (2016)

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 hierarchy of conditions for consensus solvability., , , and . PODC, page 151-160. ACM, (2001)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)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)Continuous Tasks and the Asynchronous Computability Theorem., , and . ITCS, volume 215 of LIPIcs, page 73:1-73:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)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)Collapsibility of read/write models using discrete morse theory., and . J. Appl. Comput. Topol., 1 (3-4): 365-396 (2018)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)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)