Author of the publication

Byzantine Consensus Is Θ(n²): The Dolev-Reischuk Bound Is Tight Even in Partial Synchrony!

, , , , , , and . DISC, volume 246 of LIPIcs, page 14:1-14:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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. 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

Brief Announcement: Composable Dynamic Secure Emulation., and . SPAA, page 103-105. ACM, (2022)Efficient Signature-Free Validated Agreement., , , , , , and . DISC, volume 319 of LIPIcs, page 14:1-14:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)DARE to Agree: Byzantine Agreement With Optimal Resilience and Adaptive Communication., , , , , and . PODC, page 145-156. ACM, (2024)Brief Announcement: Polygraph: Accountable Byzantine Agreement., , and . DISC, volume 179 of LIPIcs, page 45:1-45:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Every Bit Counts in Consensus., , , , , and . DISC, volume 281 of LIPIcs, page 13:1-13:26. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Brief Announcement: Probabilistic Dynamic Input/Output Automata., and . PODC, page 378-380. ACM, (2022)All Byzantine Agreement Problems Are Expensive., , , , , and . PODC, page 157-169. ACM, (2024)All Byzantine Agreement Problems are Expensive., , , , , and . CoRR, (2023)As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!, , , , and . IPDPS, page 560-570. IEEE, (2022)Byzantine Consensus is Θ(n^2): The Dolev-Reischuk Bound is Tight even in Partial Synchrony! Extended Version., , , , , , and . CoRR, (2022)