( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Optimal Algorithms for Synchronous Byzantine k-Set Agreement.

, , , и . SSS, том 13751 из Lecture Notes in Computer Science, стр. 178-192. Springer, (2022)

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.

Hugues Lantuit

Olivier Hugues

Hugues Mirault

Hugues Salamin

Theodor Hugues

 

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

An Anonymous Wait-Free Weak-Set Object Implementation., , , и . NETYS, том 11028 из Lecture Notes in Computer Science, стр. 141-156. Springer, (2018)Beyond One Third Byzantine Failures., , , , и . CoRR, (2015)t-Resilient Immediate Snapshot Is Impossible., , , и . SIROCCO, том 9988 из Lecture Notes in Computer Science, стр. 177-191. (2016)The Weakest Failure Detector for Message Passing Set-Agreement., , , и . DISC, том 5218 из Lecture Notes in Computer Science, стр. 109-120. Springer, (2008)The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers., , , , и . PODC, стр. 310-320. ACM, (2024)Latency Measures and Lower Bounds for Consensus with Failure Detectors., и . SIROCCO, том 13 из Proceedings in Informatics, стр. 87-100. Carleton Scientific, (2002)Revisiting Failure Detection and Consensus in Omission Failure Environments., , и . ICTAC, том 3722 из Lecture Notes in Computer Science, стр. 394-408. Springer, (2005)A Characterization of t-Resilient Colorless Task Anonymous Solvability., , , и . SIROCCO, том 11085 из Lecture Notes in Computer Science, стр. 178-192. Springer, (2018)Distributed Computing in the Asynchronous LOCAL model., , , и . CoRR, (2019)Secretive Birds: Privacy in Population Protocols., , , и . OPODIS, том 4878 из Lecture Notes in Computer Science, стр. 329-342. Springer, (2007)