Author:
Ahmadi Mohamad,Kuhn Fabian,Kutten Shay,Molla Anisur Rahaman,Pandurangan Gopal
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Achieving Sublinear Complexity under Constant T in T-interval Dynamic Networks;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11
2. The Universal Gossip Fighter;2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS);2022-05
3. On the power of randomization in distributed algorithms in dynamic networks with adaptive adversaries;Journal of Parallel and Distributed Computing;2022-01
4. Weak Amnesiac Flooding;2021 20th International Symposium on Parallel and Distributed Computing (ISPDC);2021-07-28
5. Weak Amnesiac Flooding of Multiple Messages;Networked Systems;2021