Author of the publication

Fast asynchronous Byzantine agreement and leader election with full information.

, , , , and . ACM Trans. Algorithms, 6 (4): 68:1-68:28 (2010)

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

A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms., and . COCOON, volume 2108 of Lecture Notes in Computer Science, page 268-277. Springer, (2001)An Optimal EREW PRAM Algorithm for Minimum Spanning Tree Verification., , , and . Inf. Process. Lett., 62 (3): 153-159 (1997)A lower bound for the recognition of digraph properties.. Combinatorica, 10 (1): 53-59 (1990)Kinetic k-Semi-Yao graph and its applications., , , and . Comput. Geom., (2019)A simple, faster method for kinetic proximity problems., , , , and . Comput. Geom., 48 (4): 342-359 (2015)Communication Costs in a Geometric Communication Network., and . ICDCN, page 36-45. ACM, (2021)Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols., , , , and . DISC, volume 179 of LIPIcs, page 31:1-31:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Sleeping on the Job: Energy-Efficient and Robust Broadcast for Radio Networks., , , and . Algorithmica, 61 (3): 518-554 (2011)Fast asynchronous byzantine agreement and leader election with full information., , , , and . SODA, page 1038-1047. SIAM, (2008)Quorums Quicken Queries: Efficient Asynchronous Secure Multiparty Computation., , , and . CoRR, (2013)