default search action
Anisur Rahaman Molla
Person information
- affiliation: Indian Statistical Institute, Kolkata
- affiliation (former): University of Freiburg, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j11]Manish Kumar, Anisur Rahaman Molla:
Sublinear message bounds of authenticated implicit Byzantine agreement. Theor. Comput. Sci. 1022: 114888 (2024) - [c44]Prabhat Kumar Chand, Apurba Das, Anisur Rahaman Molla:
Agent-Based Triangle Counting and Its Applications in Anonymous Graphs. AAMAS 2024: 2186-2188 - [c43]Debasish Pattanayak
, Subhash Bhagat
Maximal Independent Set via Mobile Agents. ICDCN 2024: 74-83 - [c42]Manish Kumar
Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement. ICDCN 2024: 124-133 - [c41]Prabhat Kumar Chand
Distributed Graph Computations via Mobile Robots. ICDCN 2024: 252-253 - [c40]Prabhat Kumar Chand
Agent-Driven BFS Tree in Anonymous Graphs with Applications. NETYS 2024: 67-82 - [c39]Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma:
Brief Announcement: Agent-Based Leader Election, MST, and Beyond. DISC 2024: 50:1-50:7 - [e2]Stéphane Devismes
Distributed Computing and Intelligent Technology - 20th International Conference, ICDCIT 2024, Bhubaneswar, India, January 17-20, 2024, Proceedings. Lecture Notes in Computer Science 14501, Springer 2024, ISBN 978-3-031-50582-9 [contents] - [i29]Prabhat Kumar Chand, Apurba Das, Anisur Rahaman Molla:
Agent-Based Triangle Counting and its Applications in Anonymous Graphs. CoRR abs/2402.03653 (2024) - [i28]Ajay D. Kshemkalyani, Manish Kumar, Anisur Rahaman Molla, Gokarna Sharma:
Agent-based MST Construction. CoRR abs/2403.13716 (2024) - [i27]Rik Banerjee, Manish Kumar, Anisur Rahaman Molla:
Optimizing Robot Dispersion on Grids: with and without Fault Tolerance. CoRR abs/2405.02002 (2024) - 2023
- [j10]Subhrangsu Mandal
Efficient live exploration of a dynamic ring with mobile robots. Theor. Comput. Sci. 980: 114201 (2023) - [j9]Manish Kumar
On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. IEEE Trans. Parallel Distributed Syst. 34(4): 1115-1127 (2023) - [c38]Prabhat Kumar Chand
Run for Cover: Dominating Set via Mobile Agents. ALGOWIN 2023: 133-150 - [c37]Prabhat Kumar Chand
Fault-Tolerant Dispersion of Mobile Robots. CALDAM 2023: 28-40 - [c36]Manish Kumar
Improved Deterministic Leader Election in Diameter-Two Networks. CIAC 2023: 323-335 - [c35]Manish Kumar
On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. ICDCN 2023: 294-295 - [c34]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. IPDPS 2023: 47-57 - [e1]Anisur Rahaman Molla
Distributed Computing and Intelligent Technology - 19th International Conference, ICDCIT 2023, Bhubaneswar, India, January 18-22, 2023, Proceedings. Lecture Notes in Computer Science 13776, Springer 2023, ISBN 978-3-031-24847-4 [contents] - [i26]Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam:
Improved Deterministic Leader Election in Diameter-Two Networks. CoRR abs/2302.11207 (2023) - [i25]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots. CoRR abs/2305.01753 (2023) - [i24]Manish Kumar, Anisur Rahaman Molla:
Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement. CoRR abs/2307.05922 (2023) - [i23]Prabhat Kumar Chand, Anisur Rahaman Molla, Sumathi Sivasubramaniam:
Run for Cover: Dominating Set via Mobile Agents. CoRR abs/2309.02200 (2023) - 2022
- [j8]Karl Bringmann, Ralph Keusch, Johannes Lengler
Greedy routing and the algorithmic small-world phenomenon. J. Comput. Syst. Sci. 125: 59-105 (2022) - [j7]Ajay D. Kshemkalyani
Dispersion of mobile robots using global communication. J. Parallel Distributed Comput. 161: 100-117 (2022) - [c33]Manish Kumar
Fault-Tolerant Graph Realizations in the Congested Clique. ALGOSENSORS 2022: 108-122 - [c32]Kaustav Bose
Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits. ICDCN 2022: 160-169 - [c31]Anisur Rahaman Molla, William K. Moses Jr.:
Dispersion of Mobile Robots. ICDCN 2022: 217-220 - [c30]John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, Yadu Vasudev:
Byzantine Connectivity Testing in the Congested Clique. DISC 2022: 7:1-7:21 - [i22]Anisur Rahaman Molla, Manish Kumar, Sumathi Sivasubramaniam:
Fault-Tolerant Graph Realizations in the Congested Clique. CoRR abs/2208.10135 (2022) - [i21]Prabhat Kumar Chand, Manish Kumar, Anisur Rahaman Molla, Sumathi Sivasubramaniam:
Fault-Tolerant Dispersion of Mobile Robots. CoRR abs/2211.12451 (2022) - 2021
- [j6]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots. Theor. Comput. Sci. 887: 111-121 (2021) - [c29]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Byzantine Dispersion on Graphs. IPDPS 2021: 942-951 - [c28]Zahra Bayramzadeh, Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Weak Amnesiac Flooding. ISPDC 2021: 122-129 - [c27]Zahra Bayramzadeh, Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Weak Amnesiac Flooding of Multiple Messages. NETYS 2021: 88-94 - [c26]Manish Kumar, Anisur Rahaman Molla:
Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement. PODC 2021: 259-262 - [c25]John Augustine, Anisur Rahaman Molla, Gopal Pandurangan
Byzantine Agreement and Leader Election: From Classical to the Modern. PODC 2021: 569-571 - [c24]Subhash Bhagat
Min-Max Gathering of Oblivious Robots. SPAA 2021: 420-422 - [i20]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Byzantine Dispersion on Graphs. CoRR abs/2102.07528 (2021) - 2020
- [j5]Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla:
The cost of global broadcast in dynamic radio networks. Theor. Comput. Sci. 806: 363-387 (2020) - [c23]Subhrangsu Mandal
Live Exploration with Mobile Robots in a Dynamic Ring, Revisited. ALGOSENSORS 2020: 92-107 - [c22]Anisur Rahaman Molla
Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots. ALGOSENSORS 2020: 154-169 - [c21]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Dispersion of Mobile Robots in the Global Communication Model. ICDCN 2020: 12:1-12:10 - [c20]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Efficient Dispersion of Mobile Robots on Dynamic Graphs. ICDCS 2020: 732-742 - [c19]Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan
Efficient Distributed Algorithms for the K-Nearest Neighbors Problem. SPAA 2020: 527-529 - [c18]Anisur Rahaman Molla
Smoothed Analysis of Leader Election in Distributed Networks. SSS 2020: 183-198 - [c17]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Dispersion of Mobile Robots on Grids. WALCOM 2020: 183-197 - [c16]John Augustine
Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols. DISC 2020: 31:1-31:19 - [i19]Subhrangsu Mandal, Anisur Rahaman Molla, William K. Moses Jr.:
Live Exploration with Mobile Robots in a Dynamic Ring, Revisited. CoRR abs/2001.04525 (2020) - [i18]Anisur Rahaman Molla, Kaushik Mondal, William K. Moses Jr.:
Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots. CoRR abs/2004.11439 (2020) - [i17]Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan:
Efficient Distributed Algorithms for the K-Nearest Neighbors Problem. CoRR abs/2005.07373 (2020) - [i16]John Augustine, Khalid Hourani, Anisur Rahaman Molla, Gopal Pandurangan, Adi Pasic:
Economy Versus Disease Spread: Reopening Mechanisms for COVID 19. CoRR abs/2009.08872 (2020)
2010 – 2019
- 2019
- [j4]Anisur Rahaman Molla, Supantha Pandit
Optimal deterministic distributed algorithms for maximal independent set in geometric graphs. J. Parallel Distributed Comput. 132: 36-47 (2019) - [c15]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Fast Dispersion of Mobile Robots on Arbitrary Graphs. ALGOSENSORS 2019: 23-40 - [c14]Mohamad Ahmadi, Fabian Kuhn, Shay Kutten, Anisur Rahaman Molla, Gopal Pandurangan
The Communication Cost of Information Spreading in Dynamic Networks. ICDCS 2019: 368-378 - [c13]Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan
Efficient Distributed Community Detection in the Stochastic Block Model. ICDCS 2019: 409-419 - [c12]Anisur Rahaman Molla
Dispersion of Mobile Robots: The Power of Randomness. TAMC 2019: 481-500 - [i15]Anisur Rahaman Molla, William K. Moses Jr.:
Dispersion of Mobile Robots: The Power of Randomness. CoRR abs/1902.10489 (2019) - [i14]Reza Fathi, Anisur Rahaman Molla, Gopal Pandurangan:
Efficient Distributed Community Detection in the Stochastic Block Model. CoRR abs/1904.07494 (2019) - [i13]John Augustine, Valerie King, Anisur Rahaman Molla, Gopal Pandurangan, Jared Saia:
Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols. CoRR abs/1907.10308 (2019) - [i12]Ajay D. Kshemkalyani, Anisur Rahaman Molla, Gokarna Sharma:
Dispersion of Mobile Robots in the Global Communication Model. CoRR abs/1909.01957 (2019) - 2018
- [c11]Anisur Rahaman Molla, Gopal Pandurangan
Local Mixing Time: Distributed Computation and Applications. IPDPS 2018: 743-752 - [c10]John Augustine, Anisur Rahaman Molla, Gopal Pandurangan:
Sublinear Message Bounds for Randomized Agreement. PODC 2018: 315-324 - [i11]Anisur Rahaman Molla, Gopal Pandurangan:
Local Mixing Time: Distributed Computation and Applications. CoRR abs/1801.01903 (2018) - [i10]Mohamad Ahmadi, Fabian Kuhn, Shay Kutten, Anisur Rahaman Molla, Gopal Pandurangan:
The Communication Cost of Information Spreading in Dynamic Networks. CoRR abs/1806.09847 (2018) - [i9]Anisur Rahaman Molla, Gokarna Sharma:
Improved Dispersion of Mobile Robots on Arbitrary Graphs. CoRR abs/1812.05352 (2018) - 2017
- [c9]Anisur Rahaman Molla, Gopal Pandurangan:
Distributed Computation of Mixing Time. ICDCN 2017: 5 - [c8]Karl Bringmann, Ralph Keusch, Johannes Lengler
Greedy Routing and the Algorithmic Small-World Phenomenon. PODC 2017: 371-380 - 2016
- [i8]Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla:
The Cost of Global Broadcast in Dynamic Radio Networks. CoRR abs/1601.01912 (2016) - [i7]Anisur Rahaman Molla, Gopal Pandurangan:
Distributed Computation of Mixing Time. CoRR abs/1610.05646 (2016) - [i6]Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy Routing and the Algorithmic Small-World Phenomenom. CoRR abs/1612.05539 (2016) - 2015
- [j3]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Efficient random walk sampling in distributed networks. J. Parallel Distributed Comput. 77: 84-94 (2015) - [j2]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Fast distributed PageRank computation. Theor. Comput. Sci. 561: 113-121 (2015) - [j1]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Distributed computation in dynamic networks via random walks. Theor. Comput. Sci. 581: 45-66 (2015) - [c7]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Distributed Computation of Sparse Cuts via Random Walks. ICDCN 2015: 6:1-6:10 - [c6]Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn, Anisur Rahaman Molla:
The Cost of Global Broadcast in Dynamic Radio Networks. OPODIS 2015: 7:1-7:17 - [c5]Fabian Kuhn, Anisur Rahaman Molla:
Distributed Sparse Cut Approximation. OPODIS 2015: 10:1-10:14 - 2013
- [c4]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Fast Distributed PageRank Computation. ICDCN 2013: 11-26 - [c3]John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan
Storage and search in dynamic peer-to-peer networks. SPAA 2013: 53-62 - [i5]John Augustine, Anisur Rahaman Molla, Ehab Morsy, Gopal Pandurangan, Peter Robinson, Eli Upfal:
Storage and Search in Dynamic Peer-to-Peer Networks. CoRR abs/1305.1121 (2013) - [i4]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Distributed Computation of Sparse Cuts. CoRR abs/1310.5407 (2013) - 2012
- [c2]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Near-optimal random walk sampling in distributed networks. INFOCOM 2012: 2906-2910 - [c1]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan
Fast Distributed Computation in Dynamic Networks via Random Walks. DISC 2012: 136-150 - [i3]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Near-Optimal Random Walk Sampling in Distributed Networks. CoRR abs/1201.1363 (2012) - [i2]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan:
Fast Distributed Computation in Dynamic Networks via Random Walks. CoRR abs/1205.5525 (2012) - [i1]Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, Eli Upfal:
Fast Distributed PageRank Computation. CoRR abs/1208.3071 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-25 20:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: