Author:
Aspnes James,Diamadi Zoë,Gjøsteen Kristian,Peralta René,Yampolskiy Aleksandr
Publisher
Springer Berlin Heidelberg
Reference40 articles.
1. Lecture Notes in Computer Science;M. Abe,1999
2. Lecture Notes in Computer Science;J. Algesheimer,2002
3. Aspnes, J., Diamadi, Z., Gjøsteen, K., Peralta, R., Yampolskiy, A.: Spreading alerts quietly and the subgroup escape problem. Technical Report YALEU/DCS/TR-1326, Yale University (August. 2005), Available at ftp://ftp.cs.yale.edu/pub/TR/tr1326.pdf
4. Beimel, A., Dolev, S.: Buses for anonymous message delivery. In: Second International Conference on FUN with Algorithms, pp. 1–13. Carleton Scientific, Ottawa (2001)
5. London Mathematical Society Lecture Note Series;I.F. Blake,1999
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Privacy in Population Protocols with Probabilistic Scheduling;Lecture Notes in Computer Science;2023
2. A Blind Coupon Mechanism Enabling Veto Voting over Unreliable Networks;Lecture Notes in Computer Science;2019
3. Spreading Alerts Quietly;Proceedings of the 13th International Conference on Availability, Reliability and Security;2018-08-27
4. Spreading Alerts Quietly and the Subgroup Escape Problem;Lecture Notes in Computer Science;2005