Author:
Chakraborty Maitri,Milani Alessia,Mosteiro Miguel A.
Publisher
Springer International Publishing
Reference12 articles.
1. Lecture Notes in Computer Science;PS Almeida,2011
2. Chakraborty, M., Milani, A., Mosteiro, M.A.: Counting in practical anonymous dynamic networks is polynomial. CoRR abs/1603.05459 (2016). http://arxiv.org/abs/1603.05459
3. Lecture Notes in Computer Science;GA Luna Di,2014
4. Di Luna, G.A., Baldoni, R., Bonomi, S., Chatzigiannakis, I.: Counting in anonymous dynamic networks under worst-case adversary. In: ICDCS 2014, pp. 338–347. IEEE (2014)
5. Lecture Notes in Computer Science;GA Luna Di,2014
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Faster Supervised Average Consensus in Adversarial and Stochastic Anonymous Dynamic Networks;ACM Transactions on Parallel Computing;2023-06-20
2. Computing in Anonymous Dynamic Networks Is Linear;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10
3. Polynomial anonymous dynamic distributed computing without a unique leader;Journal of Computer and System Sciences;2022-02
4. Heuristically Speeding up Anonymous Dynamic Network Computations;2020 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom);2020-12
5. Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations;Journal of the ACM;2020-04-30