( en | de | ru )

 

Disambiguation of "Fauconnier, Hugues"

Author of the publication

copydeleteadd this publication to your clipboard
An Exercise in Concurrency: From Non-blocking Objects to Fair Objects.

, , and . NBiS, page 1-7. IEEE Computer Society, (2014)

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.

Hugues Lantuit

Olivier Hugues

Hugues Mirault

Hugues Salamin

Theodor Hugues

 

Other publications of authors with the same name

Beyond One Third Byzantine Failures., , , , and . CoRR, (2015)The Weakest Failure Detector for Message Passing Set-Agreement., , , and . DISC, volume 5218 of Lecture Notes in Computer Science, page 109-120. Springer, (2008)Some New Results With k-set agreement., , and . CoRR, (2023)An Anonymous Wait-Free Weak-Set Object Implementation., , , and . NETYS, volume 11028 of Lecture Notes in Computer Science, page 141-156. Springer, (2018)t-Resilient Immediate Snapshot Is Impossible., , , and . SIROCCO, volume 9988 of Lecture Notes in Computer Science, page 177-191. (2016)The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers., , , , and . PODC, page 310-320. ACM, (2024)Latency Measures and Lower Bounds for Consensus with Failure Detectors., and . SIROCCO, volume 13 of Proceedings in Informatics, page 87-100. Carleton Scientific, (2002)When is Recoverable Consensus Harder Than Consensus?, , , and . PODC, page 198-208. ACM, (2022)Optimal algorithms for synchronous Byzantine k-set agreement., , , and . Theor. Comput. Sci., (September 2023)Optimal Algorithms for Synchronous Byzantine k-Set Agreement., , , and . SSS, volume 13751 of Lecture Notes in Computer Science, page 178-192. Springer, (2022)