Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. J. Bar-Ilan, D. Beaver. “Non-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction.” Proceedings of PODC, ACM, 1989, 201–209.
2. D. Barrington. “Bounded Width Polynomial Size Branching Programs Recognize Exactly those Languages in NC 1.” Proceedings of the 18th STOC, ACM, 1986, 1–5.
3. Lect Notes Comput Sci;D. Beaver,1992
4. D. Beaver, S. Micali, P. Rogaway. “The Round Complexity of Secure Protocols.” Proceedings of the 22nd STOC, ACM, 1990, 503–513.
5. M. Ben-Or, R. Cleve. “Computing Algebraic Formulas Using a Constant Number of Registers.” Proceedings of the 20th STOC, ACM, 1988, 254–257.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献