( en | de | ru )

 

Disambiguation of "Gafni, Eli"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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.

Dov Gafni

Dov Gafni

Eli Schachtel

Eli Kolundžija

Victoria Eli

 

Other publications of authors with the same name

Understanding and Verifying Distributed Algorithms Using Stratified Decomposition (Extended Abstract), , and . (1988)Structured Derivations of Consensus Algorithms for Failure Detectors., , and . PODC, page 297-306. ACM, (1998)A Proof of a Theorem in Algebraic Topology by a Distributed Algorithm (Abstract).. PODC, page 276. ACM, (1996)An Algorithmic Approach to the Asynchronous Computability Theorem., , and . CoRR, (2017)Relating LL-Resilience and Wait-Freedom via Hitting Sets., and . ICDCN, volume 6522 of Lecture Notes in Computer Science, page 191-202. Springer, (2011)Generalized Universality., and . CONCUR, volume 6901 of Lecture Notes in Computer Science, page 17-27. Springer, (2011)On Set Consensus Numbers., and . DISC, volume 5805 of Lecture Notes in Computer Science, page 35-47. Springer, (2009)The Mailbox Problem., , and . DISC, volume 5218 of Lecture Notes in Computer Science, page 1-15. Springer, (2008)Asynchronous Computability Theorems for t-Resilient Systems., , and . DISC, volume 9888 of Lecture Notes in Computer Science, page 428-441. Springer, (2016)Renaming in synchronous message passing systems with Byzantine failures., , and . Distributed Comput., 20 (6): 403-413 (2008)