Author:
Tsimos Georgios,Loss Julian,Papamanthou Charalampos
Publisher
Springer Nature Switzerland
Reference27 articles.
1. Abraham, I., Hubert Chan, T.-H., Dolev, K.N.D., Pass, R., Ren, L., Shi, E.: Communication complexity of byzantine agreement, revisited. In: Proceedings of ACM Symposium on Principles of Distributed Computing (PODC), pp. 317–326 (2019)
2. Lecture Notes in Computer Science;C Baum,2020
3. Lecture Notes in Computer Science;E Blum,2020
4. Bortnikov, E., Gurevich, M., Keidar, I., Kliot, G., Shraer, A.: Brahms: byzantine resilient random membership sampling. In: Proceedings of ACM PODC, pp. 145–154 (2008)
5. Boyle, E., Ran, Goel, A.: Breaking the $$o(\sqrt{n})$$-bit barrier: Byzantine agreement with polylog bits per party. In: Proceedings of ACM PODC, pp. 319–330 (2021)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献