Skip to content
GraphTheory.in

Anisur Rahaman Molla

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

via OpenAlex

Citations
657

via OpenAlex

Publications
85

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 (85)

Sorted by most cited.

  1. Fast Distributed PageRank Computation

    2013

    View DOI
    111 cites

  2. Fast distributed PageRank computation

    2014

    View DOI
    67 cites

  3. Fast Dispersion of Mobile Robots on Arbitrary Graphs

    2019

    View DOI
    38 cites

  4. Dispersion of Mobile Robots on Grids

    2020

    View DOI
    34 cites

  5. Distributed computation in dynamic networks via random walks

    2015

    View DOI
    33 cites

  6. Dispersion of Mobile Robots: The Power of Randomness

    1970book chapter

    View DOI
    28 cites

  7. Greedy Routing and the Algorithmic Small-World Phenomenon

    2017

    View DOI
    24 cites

  8. Efficient Dispersion of Mobile Robots on Dynamic Graphs

    2020

    View DOI
    21 cites

  9. Dispersion of mobile robots using global communication

    2021

    View DOI
    20 cites

  10. Distributed Computation of Sparse Cuts via Random Walks

    2015

    View DOI
    14 cites

  11. Efficient random walk sampling in distributed networks

    2015

    View DOI
    13 cites

  12. Sublinear Message Bounds for Randomized Agreement

    2018

    View DOI
    12 cites

  13. Maximal Independent Set via Mobile Agents

    2024conference paper

    View DOI
    10 cites

  14. Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots

    2021

    View DOI
    10 cites

  15. Distributed Sparse Cut Approximation

    2016

    View DOI
    9 cites

  16. Fault-Tolerant Dispersion of Mobile Robots

    1970book chapter

    View DOI
    8 cites

  17. The cost of global broadcast in dynamic radio networks

    2019

    View DOI
    6 cites

  18. Optimal deterministic distributed algorithms for maximal independent set in geometric graphs

    2019

    View DOI
    6 cites

  19. Distributed Computation of Mixing Time

    2017

    View DOI
    6 cites

  20. Brief Announcement

    2021

    View DOI
    5 cites

  21. Greedy Routing and the Algorithmic Small-World Phenomenom

    2016

    View DOI
    5 cites

  22. Greedy routing and the algorithmic small-world phenomenon

    Journal of Computer and System Sciences2022journal article

    View DOI
    4 cites

  23. Fast Distributed Computation in Dynamic Networks via Random Walks

    2012

    View DOI
    4 cites

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

    1970book chapter

    View DOI
    4 cites

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

    IEEE Transactions on Parallel and Distributed Systems1970journal article

    View DOI
    4 cites

  26. Optimal Fault-Tolerant Dispersion on Oriented Grids

    2025conference paper

    View DOI
    3 cites

  27. Dispersion of Mobile Robots

    2022

    View DOI
    3 cites

  28. Weak Amnesiac Flooding of Multiple Messages

    2021

    View DOI
    3 cites

  29. Distributed Computation of Sparse Cuts

    2013

    View DOI
    3 cites

  30. Smoothed Analysis of Leader Election in Distributed Networks

    1970book chapter

    View DOI
    3 cites

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

    1970book chapter

    View DOI
    3 cites

  32. Agent-Based Triangle Counting: Unlocking Truss Decomposition, Triangle Centrality, and Local Clustering Coefficient

    2024

    View DOI
    2 cites

  33. Efficient live exploration of a dynamic ring with mobile robots

    2023

    View DOI
    2 cites

  34. Economy Versus Disease Spread: Reopening Mechanisms for COVID 19

    2020

    View DOI
    2 cites

  35. Dispersion of Mobile Robots in the Global Communication Model

    2020

    View DOI
    2 cites

  36. Efficient Dispersion of Mobile Robots on Arbitrary Graphs and Grids

    2018

    View DOI
    2 cites

  37. Near-Optimal Random Walk Sampling in Distributed Networks

    2012

    View DOI
    2 cites

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

    1970book chapter

    View DOI
    2 cites

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

    1970book chapter

    View DOI
    2 cites

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

    1970book chapter

    View DOI
    2 cites

  41. Brief Announcement: Distributed Butterfly Analysis using Mobile Agents

    2025conference paper

    View DOI
    1 cites

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

    2025conference paper

    View DOI
    1 cites

  43. Near-Linear Time Leader Election in Multiagent Networks

    2025

    View DOI
    1 cites

  44. Distributed Computing and Intelligent Technology

    2024

    View DOI
    1 cites

  45. Distributed Computing and Intelligent Technology

    2023

    View DOI
    1 cites

  46. Fault-Tolerant Graph Realizations in the Congested Clique

    2022

    View DOI
    1 cites

  47. Weak Amnesiac Flooding

    2021

    View DOI
    1 cites

  48. Efficient Distributed Algorithms for the K-Nearest Neighbors Problem

    2020

    View DOI
    1 cites

  49. Efficient Distributed Community Detection in the Stochastic Block Model

    2019

    View DOI
    1 cites

  50. Improved Dispersion of Mobile Robots on Arbitrary Graphs.

    2018

    1 cites

  51. Local Mixing Time: Distributed Computation and Applications

    2018

    View DOI
    1 cites

  52. Storage and Search in Dynamic Peer-to-Peer Networks

    2013

    View DOI
    1 cites

  53. Semi-Synchronous Exploration in Dynamic Graphs

    2026

    0 cites

  54. Toward Optimality: A Tighter Analysis of Message Complexity for Leader Election in Diameter-Two Networks

    2026

    0 cites

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

    2025

    View DOI
    0 cites

  56. Faster leader election via mobile agents and its applications

    2025

    View DOI
    0 cites

  57. Fault-tolerant dispersion of mobile robots

    2025

    View DOI
    0 cites

  58. Agentic Distributed Computing

    2025

    0 cites

  59. Brief Announcement: Optimal Dispersion Under Asynchrony

    2025

    View DOI
    0 cites

  60. Optimal Fault-Tolerant Dispersion on Oriented Grids

    2024

    View DOI
    0 cites

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

    2024

    View DOI
    0 cites

  62. Optimizing Robot Dispersion on Grids: with and without Fault Tolerance

    2024

    View DOI
    0 cites

  63. Agent-based Leader Election, MST, and Beyond

    2024

    View DOI
    0 cites

  64. Distributed Graph Computations via Mobile Robots

    2024conference paper

    View DOI
    0 cites

  65. Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement

    2024conference paper

    View DOI
    0 cites

  66. Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement

    2023

    View DOI
    0 cites

  67. Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots

    2023

    View DOI
    0 cites

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

    2023conference paper

    View DOI
    0 cites

  69. Fault-Tolerant Dispersion of Mobile Robots

    2022

    View DOI
    0 cites

  70. Scheduling mechanisms to control the spread of COVID-19

    2022

    View DOI
    0 cites

  71. Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits

    2022

    View DOI
    0 cites

  72. INHIBITION OF AMYLOID BETA FIBRILIZATION BY SMALL ORGANIC MOLECULES: AN IMPLICATION TO THERAPEUTIC ROUTE OF ALZHEIMER’S DISEASE

    2021

    View DOI
    0 cites

  73. Byzantine Agreement and Leader Election

    2021

    View DOI
    0 cites

  74. Min-Max Gathering of Oblivious Robots

    2021

    View DOI
    0 cites

  75. Byzantine Dispersion on Graphs

    2021

    View DOI
    0 cites

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

    2020

    0 cites

  77. Efficient Dispersion on an Anonymous Ring in the Presence of Weak\n Byzantine Robots

    2020

    View DOI
    0 cites

  78. Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols

    2019

    View DOI
    0 cites

  79. The Communication Cost of Information Spreading in Dynamic Networks

    2019

    View DOI
    0 cites

  80. Distributed Computation of Mixing Time

    2016

    View DOI
    0 cites

  81. Computing Tree Structures in Anonymous Graphs via Mobile Agents

    1970book chapter

    View DOI
    0 cites

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

    1970book chapter

    View DOI
    0 cites

  83. Improved Deterministic Leader Election in Diameter-Two Networks

    1970book chapter

    View DOI
    0 cites

  84. Run for Cover: Dominating Set via Mobile Agents

    1970book chapter

    View DOI
    0 cites

  85. Fault-Tolerant Graph Realizations in the Congested Clique

    1970book chapter

    View DOI
    0 cites