Anisur Rahaman Molla
Papers
20
Total Citations
209
H-Index
8
About
Anisur Rahaman Molla is a leading researcher in distributed computing and mobile robotics, with a core focus on the **dispersion problem**—the challenge of coordinating autonomous robots to occupy distinct nodes on an unknown graph. His work has fundamentally advanced this field, demonstrating how mobile agents can efficiently achieve dispersion on arbitrary graphs, grids, and dynamic networks. His 2019 paper on "Fast Dispersion of Mobile Robots on Arbitrary Graphs" (38 citations) and his 2020 work on grids (34 citations) are foundational, establishing optimal time and memory bounds. Molla has also pioneered the study of **randomized algorithms** (28 citations) and **fault tolerance**, addressing scenarios with weak Byzantine robots (10 citations) and dynamic topologies (21 citations). Beyond dispersion, he has applied mobile agents to classic graph problems, including **maximal independent set** (10 citations) and **dominating set** (11 citations), showing how robots can solve these tasks without global knowledge. With over 180 total citations, Molla’s research bridges theory and practice, offering elegant algorithms that are both provably optimal and resilient to failures—making him a key figure for students and researchers interested in the frontiers of autonomous multi-robot coordination.
Research Focus
Key Achievements
Top Papers
- 1Fast Dispersion of Mobile Robots on Arbitrary Graphs38 citations · 2019
- 2Dispersion of Mobile Robots on Grids34 citations · 2020
- 3Dispersion of Mobile Robots: The Power of Randomness28 citations · 2019
- 4Efficient Dispersion of Mobile Robots on Dynamic Graphs21 citations · 2020
- 5Dispersion of mobile robots using global communication20 citations · 2021
- 6Run for Cover: Dominating Set via Mobile Agents11 citations · 2023
- 7
- 8Maximal Independent Set via Mobile Agents10 citations · 2024
- 9Fault-Tolerant Dispersion of Mobile Robots8 citations · 2023
- 10