Author:
Zhang Cong,Li Shuaishuai,Lin Dongdai
Publisher
Springer Nature Switzerland
Reference45 articles.
1. Lecture Notes in Computer Science;A Aly,2018
2. Lecture Notes in Computer Science;B Applebaum,2017
3. Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In: Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, Edmonton, Alberta, Canada, 14–16 August 1989, pp. 201–209 (1989)
4. Lecture Notes in Computer Science;D Beaver,1992
5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 2–4 May 1988, Chicago, Illinois, USA, pp. 1–10 (1988)