共 50 条
- [1] Deterministic Byzantine Agreement with Adaptive O(n • f) Communication PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 1120 - 1146
- [3] Breaking the O(n2) Bit Barrier: Scalable Byzantine Agreement with an Adaptive Adversary PODC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2010, : 420 - 429
- [5] Synchronous Byzantine Lattice Agreement in O(log(f)) Rounds 2020 IEEE 40TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS), 2020, : 146 - 156
- [8] Byzantine Agreement with Homonyms PODC 11: PROCEEDINGS OF THE 2011 ACM SYMPOSIUM PRINCIPLES OF DISTRIBUTED COMPUTING, 2011, : 21 - 30