Byzantine agreement in polynomial time with near-optimal resilience

Shang-En Huang, Seth Pettie, Leqi Zhu. Byzantine agreement in polynomial time with near-optimal resilience. In Stefano Leonardi, Anupam Gupta 0001, editors, STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022. pages 502-514, ACM, 2022. [doi]

@inproceedings{HuangPZ22-0,
  title = {Byzantine agreement in polynomial time with near-optimal resilience},
  author = {Shang-En Huang and Seth Pettie and Leqi Zhu},
  year = {2022},
  doi = {10.1145/3519935.3520015},
  url = {https://doi.org/10.1145/3519935.3520015},
  researchr = {https://researchr.org/publication/HuangPZ22-0},
  cites = {0},
  citedby = {0},
  pages = {502-514},
  booktitle = {STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022},
  editor = {Stefano Leonardi and Anupam Gupta 0001},
  publisher = {ACM},
  isbn = {978-1-4503-9264-8},
}