Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. Fault-tolerant minimum broadcast networks;Ahlswede;Networks,1996
2. Messy broadcasting in networks;Ahlswede;Commun. Cryptogr.,1994
3. The worst case behavior of randomized gossip;Baumann,2012
4. On maximal instances for the original syntenic distance;Chauve;Theoret. Comput. Sci.,2004
5. On the number of rounds necessary to disseminate information;Even,1989
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Typology of the reality of gossiping actions in the campus social system;AIP Conference Proceedings;2023
2. Research on Gossip Algorithms with Binary Exponential Backoff;J ELECTRON INF TECHN;2021
3. A Synchronous Gossip Algorithm with Exponential Backoff;2018 IEEE SmartWorld, Ubiquitous Intelligence & Computing, Advanced & Trusted Computing, Scalable Computing & Communications, Cloud & Big Data Computing, Internet of People and Smart City Innovation (SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI);2018-10
4. Optimal odd gossiping;Discrete Applied Mathematics;2018-10