Author:
Daknama Rami,Panagiotou Konstantinos,Reisser Simon
Publisher
Springer International Publishing
Reference22 articles.
1. Birman, K.P., Hayden, M., Ozkasap, O., Xiao, Z., Budiu, M., Minsky, Y.: Bimodal multicast. ACM Trans. Comput. Syst. 17(2), 41–88 (1999)
2. Boucheron, S., Lugosi, G., Massart, P.: A sharp concentration inequality with applications. Random Struct. Algorithms 16(3), 277–292 (2000)
3. Chierichetti, F., Lattanzi, S., Panconesi, A.: Almost tight bounds for rumour spreading with conductance. In: Proceedings of the 42nd ACM Symposium on Theory of Computing, pp. 399–408. ACM (2010)
4. Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumour spreading and graph conductance. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1657–1663. SIAM (2010)
5. Daknama, R., Panagiotou, K., Reisser, S.: Robustness of randomized rumour spreading. In: Proceedings of the 27th Annual European Symposium on Algorithms, ESA. Leibniz International Proceedings in Informatics (LIPIcs), vol. 144, pp. 36:1–36:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2019)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献