Author of the publication

Make Every Word Count: Adaptive Byzantine Agreement with Fewer Words.

, , and . OPODIS, volume 253 of LIPIcs, page 18:1-18: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

Dynamic Atomic Snapshots., and . OPODIS, volume 70 of LIPIcs, page 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Integrated Bounds for Disintegrated Storage., , and . DISC, volume 121 of LIPIcs, page 11:1-11:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures., , and . ACM Conference on Computer and Communications Security, page 1751-1767. ACM, (2020)Bullshark: DAG BFT Protocols Made Practical., , , and . CCS, page 2705-2718. ACM, (2022)Nesting and composition in transactional data structure libraries., , , , and . PPoPP, page 405-406. ACM, (2020)All You Need is DAG., , , and . PODC, page 165-175. ACM, (2021)Tuning PoW with Hybrid Expenditure., , and . Tokenomics, volume 97 of OASIcs, page 3:1-3:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Brief Announcement: Transactional Data Structure Libraries., , and . SPAA, page 133-134. ACM, (2016)Game of Coins., , and . CoRR, (2018)Validated Asynchronous Byzantine Agreement with Optimal Resilience and Asymptotically Optimal Time and Word Communication., , and . CoRR, (2018)