Author:
Cohen Gil,Damgård Ivan Bjerre,Ishai Yuval,Kölker Jonas,Miltersen Peter Bro,Raz Ran,Rothblum Ron D.
Publisher
Springer Berlin Heidelberg
Reference42 articles.
1. Ajtai, M., Komlós, J., Szemerédi, E.: An o(n log n) sorting network. In: STOC, pp. 1–9 (1983)
2. Akers, S., Robbins, T.: Logical design with three-input majority gates. Computer Design 45(3), 12–27 (1963)
3. Barkol, O., Ishai, Y., Weinreb, E.: On locally decodable codes, self-correctable codes, and t-private PIR. Algorithmica 58(4), 831–859 (2010)
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1–10 (1988)
5. Bracha, G.: An O(log n) expected rounds randomized byzantine generals protocol. J. ACM 34(4), 910–920 (1987)
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献