Anisur Rahaman Molla

From MaRDI portal
(Redirected from Anisur Rahaman Molla)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Guest editorial -- selected papers from ICDCIT 2022 \& 2023
Theoretical Computer Science
2026-05-11Paper
Linear-time dominating set construction and leader election using mobile agents
Theoretical Computer Science
2026-01-01Paper
Faster leader election via mobile agents and its applications
Theoretical Computer Science
2025-12-05Paper
Fault-tolerant dispersion of mobile robots
Discrete Applied Mathematics
2025-09-17Paper
Sublinear message bounds of authenticated implicit Byzantine agreement
Theoretical Computer Science
2024-12-02Paper
Fast dispersion of mobile robots on arbitrary graphs2024-04-05Paper
Byzantine Agreement and Leader Election
Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing
2024-03-26Paper
Efficient live exploration of a dynamic ring with mobile robots
Theoretical Computer Science
2023-11-17Paper
Scalable and secure computation among strangers: message-competitive Byzantine protocols2023-11-02Paper
Smoothed Analysis of Leader Election in Distributed Networks2023-03-21Paper
Greedy routing and the algorithmic small-world phenomenon
Journal of Computer and System Sciences
2022-01-31Paper
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots
Theoretical Computer Science
2021-09-27Paper
Live exploration with mobile robots in a dynamic ring (revisited)
(available as arXiv preprint)
2021-07-08Paper
Efficient dispersion on an anonymous ring in the presence of weak Byzantine robots
(available as arXiv preprint)
2021-07-08Paper
Dispersion of mobile robots on grids2020-07-22Paper
The cost of global broadcast in dynamic radio networks
Theoretical Computer Science
2020-01-16Paper
Dispersion of mobile robots: the power of randomness
(available as arXiv preprint)
2019-10-15Paper
Sublinear message bounds for randomized agreement
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing
2019-09-19Paper
Greedy routing and the algorithmic small-world phenomenon
Proceedings of the ACM Symposium on Principles of Distributed Computing
2017-10-11Paper
The cost of global broadcast in dynamic radio networks
(available as arXiv preprint)
2017-09-29Paper
Distributed sparse cut approximation2017-09-29Paper
Distributed computation in dynamic networks via random walks
Theoretical Computer Science
2015-05-22Paper
Fast distributed PageRank computation
Theoretical Computer Science
2014-12-02Paper
Fast distributed computation in dynamic networks via random walks
Lecture Notes in Computer Science
2013-03-13Paper


Research outcomes over time


This page was built for person: Anisur Rahaman Molla