Anisur Rahaman Molla

647 total citations
27 papers, 150 citations indexed

About

Anisur Rahaman Molla is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Mechanical Engineering. According to data from OpenAlex, Anisur Rahaman Molla has authored 27 papers receiving a total of 150 indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Computer Networks and Communications, 7 papers in Computational Theory and Mathematics and 5 papers in Mechanical Engineering. Recurrent topics in Anisur Rahaman Molla's work include Optimization and Search Problems (13 papers), Distributed systems and fault tolerance (12 papers) and Caching and Content Delivery (6 papers). Anisur Rahaman Molla is often cited by papers focused on Optimization and Search Problems (13 papers), Distributed systems and fault tolerance (12 papers) and Caching and Content Delivery (6 papers). Anisur Rahaman Molla collaborates with scholars based in India, United States and Singapore. Anisur Rahaman Molla's co-authors include Gopal Pandurangan, Atish Das Sarma, Eli Upfal, Gokarna Sharma, Ajay D. Kshemkalyani, John Augustine, Johannes Lengler, Karl Bringmann, Peter Robinson and Fabian Kühn and has published in prestigious journals such as IEEE Transactions on Parallel and Distributed Systems, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

Anisur Rahaman Molla

22 papers receiving 148 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Anisur Rahaman Molla India	7	85	47	46	35	20	27	150
Nicolas Hanusse France	5	46 0.5×	24 0.5×	19 0.4×	47 1.3×	5 0.3×	16	122
Konstantin Kutzkov Denmark	6	42 0.5×	47 1.0×	67 1.5×	25 0.7×	15 0.8×	13	123
Danil Nemirovsky France	6	62 0.7×	86 1.8×	91 2.0×	18 0.5×	65 3.3×	10	189
Mihaela Enachescu United States	5	263 3.1×	13 0.3×	28 0.6×	14 0.4×	11 0.6×	7	323
Adrian Vladu United States	6	34 0.4×	44 0.9×	19 0.4×	63 1.8×	4 0.2×	12	120
Marvin Künnemann Germany	6	32 0.4×	84 1.8×	15 0.3×	51 1.5×	3 0.1×	19	142
Aaram Yun South Korea	6	121 1.4×	173 3.7×	62 1.3×	21 0.6×	141 7.0×	9	274
Guillem Perarnau Spain	7	29 0.3×	18 0.4×	42 0.9×	89 2.5×	4 0.2×	35	166
Keren Censor-Hillel Israel	11	272 3.2×	90 1.9×	22 0.5×	149 4.3×	6 0.3×	47	327
Hossein Jowhari Canada	5	55 0.6×	59 1.3×	7 0.2×	55 1.6×	6 0.3×	9	100

Countries citing papers authored by Anisur Rahaman Molla

Since Specialization

Citations

This map shows the geographic impact of Anisur Rahaman Molla's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Anisur Rahaman Molla with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Anisur Rahaman Molla more than expected).

Fields of papers citing papers by Anisur Rahaman Molla

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Anisur Rahaman Molla. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Anisur Rahaman Molla. The network helps show where Anisur Rahaman Molla may publish in the future.

Co-authorship network of co-authors of Anisur Rahaman Molla

This figure shows the co-authorship network connecting the top 25 collaborators of Anisur Rahaman Molla. A scholar is included among the top collaborators of Anisur Rahaman Molla based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Anisur Rahaman Molla. Anisur Rahaman Molla is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Molla, Anisur Rahaman, et al.. (2025). Optimal Fault-Tolerant Dispersion on Oriented Grids. 254–258. 1 indexed citations

Kshemkalyani, Ajay D., et al.. (2025). Dispersion is (Almost) Optimal under (A)synchrony. 367–381.

Molla, Anisur Rahaman, et al.. (2024). Sublinear message bounds of authenticated implicit Byzantine agreement. Theoretical Computer Science. 1022. 114888–114888. 1 indexed citations

Chaudhuri, Sruti Gan, et al.. (2024). Maximal Independent Set via Mobile Agents. 74–83.

Molla, Anisur Rahaman, et al.. (2023). Efficient live exploration of a dynamic ring with mobile robots. Theoretical Computer Science. 980. 114201–114201.

Molla, Anisur Rahaman, et al.. (2023). Distributed Computing and Intelligent Technology. Lecture notes in computer science. 1 indexed citations

Molla, Anisur Rahaman, et al.. (2023). On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. IEEE Transactions on Parallel and Distributed Systems. 34(4). 1115–1127. 1 indexed citations

Kshemkalyani, Ajay D., Anisur Rahaman Molla, & Gokarna Sharma. (2021). Dispersion of mobile robots using global communication. Journal of Parallel and Distributed Computing. 161. 100–117. 6 indexed citations

Molla, Anisur Rahaman, et al.. (2021). Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots. Theoretical Computer Science. 887. 111–121. 2 indexed citations

10.

Augustine, John, Valerie King, Anisur Rahaman Molla, Gopal Pandurangan, & Jared Saia. (2020). Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

11.

Augustine, John, Anisur Rahaman Molla, & Gopal Pandurangan. (2018). Sublinear Message Bounds for Randomized Agreement. 315–324. 4 indexed citations

12.

Bringmann, Karl, et al.. (2017). Greedy Routing and the Algorithmic Small-World Phenomenon. 371–380. 10 indexed citations

13.

Molla, Anisur Rahaman & Gopal Pandurangan. (2017). Distributed Computation of Mixing Time. 1–4. 4 indexed citations

14.

Kühn, Fabian & Anisur Rahaman Molla. (2016). Distributed Sparse Cut Approximation. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 2 indexed citations

15.

Sarma, Atish Das, Anisur Rahaman Molla, & Gopal Pandurangan. (2015). Distributed computation in dynamic networks via random walks. Theoretical Computer Science. 581. 45–66. 16 indexed citations

16.

Sarma, Atish Das, Anisur Rahaman Molla, & Gopal Pandurangan. (2015). Efficient random walk sampling in distributed networks. Journal of Parallel and Distributed Computing. 77. 84–94. 11 indexed citations

17.

Sarma, Atish Das, Anisur Rahaman Molla, & Gopal Pandurangan. (2015). Distributed Computation of Sparse Cuts via Random Walks. 1–10. 4 indexed citations

18.

Sarma, Atish Das, Anisur Rahaman Molla, Gopal Pandurangan, & Eli Upfal. (2014). Fast distributed PageRank computation. Theoretical Computer Science. 561. 113–121. 43 indexed citations

19.

Augustine, John, et al.. (2013). Storage and search in dynamic peer-to-peer networks. 53–62. 17 indexed citations

20.

Sarma, Atish Das, Anisur Rahaman Molla, & Gopal Pandurangan. (2012). Near-optimal random walk sampling in distributed networks. DR-NTU (Nanyang Technological University). 2906–2910. 10 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact