From post

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

, , , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 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.

 

Другие публикации лиц с тем же именем

The BG Distributed Simulation Algorithm, , , , и . Distributed Computing, (1997)Collapsibility of read/write models using discrete morse theory., и . J. Appl. Comput. Topol., 1 (3-4): 365-396 (2018)An Equivariance Theorem with Applications to Renaming., , и . LATIN, том 7256 из Lecture Notes in Computer Science, стр. 133-144. Springer, (2012)Iterated Shared Memory Models.. LATIN, том 6034 из Lecture Notes in Computer Science, стр. 407-416. Springer, (2010)On the Borowsky-Gafni Simulation Algorithm (Abstract)., и . PODC, стр. 57. ACM, (1996)A hierarchy of conditions for consensus solvability., , , и . PODC, стр. 151-160. ACM, (2001)On the Average Performance of Synchronized Programs in Distributed Networks (Preliminary Version)., и . WDAG, том 486 из Lecture Notes in Computer Science, стр. 102-121. Springer, (1990)The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract)., и . WDAG, том 1151 из Lecture Notes in Computer Science, стр. 322-343. Springer, (1996)Unison, Canon, and Sluggish Clocks in Networks Controlled by a Synchronizer., и . Math. Syst. Theory, 28 (5): 421-435 (1995)Asynchronous Agreement and Its Relation with Error-Correcting Codes., , , и . IEEE Trans. Computers, 56 (7): 865-875 (2007)