Author:
Ghaffari Mohsen,Newport Calvin
Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Baumann, H., Fraigniaud, P., Harutyunyan, H.A., De Verclos, R.: The worst case behavior of randomized gossip protocols. Theoret. Comput. Sci. 560, 108–120 (2014)
2. Chierichetti, F., Lattanzi, S., Panconesi, A.: Rumour spreading and graph conductance. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA) (2010)
3. Clarkson, T., Gorse, D., Taylor, J., Ng, C.: Epidemic algorithms for replicated database management. IEEE Trans. Comput. 1, 52–61 (1992)
4. Daum, S., Kuhn, F., Maus, Y.: Rumor spreading with bounded in-degree. arXiv preprint arXiv:1506.00828 (2015)
5. Lecture Notes in Computer Science;N Fountoulakis,2010
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. DisruptaBLE: Opportunistic BLE Networking;2022 IEEE 47th Conference on Local Computer Networks (LCN);2022-09-26
2. Distributed Social Learning With Imperfect Information;IEEE Transactions on Network Science and Engineering;2021-04-01
3. Fast Fault-Tolerant Sampling via Random Walk in Dynamic Networks;2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS);2019-07
4. Gossip in a Smartphone Peer-to-Peer Network;Proceedings of the ACM Symposium on Principles of Distributed Computing;2017-07-25
5. How to Discreetly Spread a Rumor in a Crowd;Lecture Notes in Computer Science;2016