Byzantine agreement in polynomial time with near-optimal resilience (Conference Paper) | NSF PAGES

skip to main content

Citation Details

Byzantine agreement in polynomial time with near-optimal resilience

Award ID(s):: 1815316

NSF-PAR ID:: 10359267

Author(s) / Creator(s):: Huang, Shang-En; Pettie, Seth; Zhu, Leqi

Date Published:: 2022-01-01

Journal Name:: ACM Symposium on Theory of Computing

Page Range / eLocation ID:: 502 to 514

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Conference Paper:
https://doi.org/10.1145/3519935.3520015