1. A Trade-Off between Information and Communication in Broadcast Protocols;Awerbuch Baruch;J. ACM,1990
2. Information dissemination in distributed systems with faulty units;Bagchi Anindo;IEEE Trans. Comput.,1994
3. Joshua Baron , Karim El Defrawy , Joshua Lampkins , and Rafail Ostrovsky . 2014 . How to withstand mobile virus attacks, revisited . In ACM Symposium on Principles of Distributed Computing, PODC '14 , Paris, France, July 15--18 , 2014, Magnús M. Halldórsson and Shlomi Dolev (Eds.). ACM, 293--302. Joshua Baron, Karim El Defrawy, Joshua Lampkins, and Rafail Ostrovsky. 2014. How to withstand mobile virus attacks, revisited. In ACM Symposium on Principles of Distributed Computing, PODC '14, Paris, France, July 15--18, 2014, Magnús M. Halldórsson and Shlomi Dolev (Eds.). ACM, 293--302.
4. Zuzana Beerliová-Trubíniová and Martin Hirt . 2008 . Perfectly-Secure MPC with Linear Communication Complexity. In Theory of Cryptography , Fifth Theory of Cryptography Conference (TCC) (Lecture Notes in Computer Science , Vol. 4948), Ran Canetti (Ed.). Springer, 213-- 230 . Zuzana Beerliová-Trubíniová and Martin Hirt. 2008. Perfectly-Secure MPC with Linear Communication Complexity. In Theory of Cryptography, Fifth Theory of Cryptography Conference (TCC) (Lecture Notes in Computer Science, Vol. 4948), Ran Canetti (Ed.). Springer, 213--230.
5. Michael Ben-Or , Shafi Goldwasser , and Avi Wigderson . 1988 . Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) . In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4 , 1988, Chicago, Illinois, USA. 1--10. Michael Ben-Or, Shafi Goldwasser, and Avi Wigderson. 1988. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2--4, 1988, Chicago, Illinois, USA. 1--10.