Skip to content
GraphTheory.in

Anisur Rahaman Molla

Indian Statistical InstituteIN
ORCID0000-0002-1537-3462
Claim this profile
h-index
13

via OpenAlex

Citations
649

via OpenAlex

Publications
25

About

Anisur Rahaman Molla is a researcher at the Indian Statistical Institute. With a prolific output of 25 publications, spanning over five decades from 1970 to 2025, he has made significant contributions to distributed network algorithms, dynamic networks, and security in distributed computing. His work explores efficient solutions for leader election, dispersion, and graph computations in distributed systems.

Research areas

  • Computer science
  • Algorithm
  • Distributed computing
  • Mathematics
  • Theoretical computer science

Publications (25)

Sorted by most cited.

  1. Greedy Routing and the Algorithmic Small-World Phenomenon

    2017

    View DOI
    23 cites

  2. Greedy routing and the algorithmic small-world phenomenon

    Journal of Computer and System Sciences2022journal article

    View DOI
    4 cites

  3. Smoothed Analysis of Leader Election in Distributed Networks

    1970book chapter

    View DOI
    3 cites

  4. Faster leader election via mobile agents and its applications

    2025

    View DOI
    0 cites

  5. Brief Announcement: Distributed Butterfly Analysis using Mobile Agents

    2025conference paper

    View DOI
    0 cites

  6. Dispersion is (Almost) Optimal under (A)synchrony

    2025conference paper

    View DOI
    0 cites

  7. Optimal Fault-Tolerant Dispersion on Oriented Grids

    2025conference paper

    View DOI
    0 cites

  8. Agent-Based Triangle Counting and Its Applications in Anonymous Graphs

    2024

    View DOI
    0 cites

  9. Distributed Graph Computations via Mobile Robots

    2024conference paper

    View DOI
    0 cites

  10. Maximal Independent Set via Mobile Agents

    2024conference paper

    View DOI
    0 cites

  11. Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement

    2024conference paper

    View DOI
    0 cites

  12. On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement

    2023conference paper

    View DOI
    0 cites

  13. Computing Tree Structures in Anonymous Graphs via Mobile Agents

    1970book chapter

    View DOI
    0 cites

  14. Improved Linear-Time Construction of Minimal Dominating Set via Mobile Agents

    1970book chapter

    View DOI
    0 cites

  15. Faster Leader Election and Its Applications for Mobile Agents with Parameter Advice

    1970book chapter

    View DOI
    0 cites

  16. Optimizing Robot Dispersion on Unoriented Grids: With and Without Fault Tolerance

    1970book chapter

    View DOI
    0 cites

  17. Agent-Driven BFS Tree in Anonymous Graphs with Applications

    1970book chapter

    View DOI
    0 cites

  18. On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement

    IEEE Transactions on Parallel and Distributed Systems1970journal article

    View DOI
    0 cites

  19. Fault-Tolerant Dispersion of Mobile Robots

    1970book chapter

    View DOI
    0 cites

  20. Improved Deterministic Leader Election in Diameter-Two Networks

    1970book chapter

    View DOI
    0 cites

  21. Run for Cover: Dominating Set via Mobile Agents

    1970book chapter

    View DOI
    0 cites

  22. Fault-Tolerant Graph Realizations in the Congested Clique

    1970book chapter

    View DOI
    0 cites

  23. Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots

    1970book chapter

    View DOI
    0 cites

  24. Live Exploration with Mobile Robots in a Dynamic Ring, Revisited

    1970book chapter

    View DOI
    0 cites

  25. Dispersion of Mobile Robots: The Power of Randomness

    1970book chapter

    View DOI
    0 cites