Author of the publication

t-Resilient Immediate Snapshot Is Impossible.

, , , and . SIROCCO, volume 9988 of Lecture Notes in Computer Science, page 177-191. (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

t-Resilient Immediate Snapshot Is Impossible., , , and . SIROCCO, volume 9988 of Lecture Notes in Computer Science, page 177-191. (2016)Distributed computability: Relating k-immediate snapshot and x-set agreement., , , and . Inf. Comput., 285 (Part): 104815 (2022)Making Local Algorithms Wait-Free: The Case of Ring Coloring., , , , and . SSS, volume 10083 of Lecture Notes in Computer Science, page 109-125. (2016)Special Issue on NETYS'2016., and . Computing, 101 (1): 1-2 (2019)t-Resilient k-Immediate Snapshot and its Relation with Agreement Problems., , , and . CoRR, (2020)An Axiomatization of the Intermittent Assertion Method Using Temporal Logic (Extended Abstract)., and . ICALP, volume 154 of Lecture Notes in Computer Science, page 15-27. Springer, (1983)An Exercise in Concurrency: From Non-blocking Objects to Fair Objects., , and . NBiS, page 1-7. IEEE Computer Society, (2014)k-Immediate Snapshot and x-Set Agreement: How Are They Related?, , , and . SSS, volume 12514 of Lecture Notes in Computer Science, page 97-112. Springer, (2020)The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers., , , , and . CoRR, (2023)The minimum information about failures for solving non-local tasks in message-passing systems., , and . Distributed Comput., 24 (5): 255-269 (2011)