Anisur Rahaman Molla

Orcid: 0000-0002-1537-3462

Affiliations:
  • Indian Statistical Institute, Kolkata
  • University of Freiburg, Germany (former)


According to our database1, Anisur Rahaman Molla authored at least 59 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Sublinear message bounds of authenticated implicit Byzantine agreement.
Theor. Comput. Sci., 2024

Optimal Fault-Tolerant Dispersion on Oriented Grids.
CoRR, 2024

Optimizing Robot Dispersion on Grids: with and without Fault Tolerance.
CoRR, 2024

Agent-based MST Construction.
CoRR, 2024

Brief Announcement: Agent-Based Leader Election, MST, and Beyond.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

Agent-Driven BFS Tree in Anonymous Graphs with Applications.
Proceedings of the Networked Systems - 12th International Conference, 2024

Maximal Independent Set via Mobile Agents.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

Distributed Graph Computations via Mobile Robots.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

Agent-Based Triangle Counting and Its Applications in Anonymous Graphs.
Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems, 2024

2023
Efficient live exploration of a dynamic ring with mobile robots.
Theor. Comput. Sci., November, 2023

On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement.
IEEE Trans. Parallel Distributed Syst., April, 2023

Fast Deterministic Gathering with Detection on Arbitrary Graphs: The Power of Many Robots.
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2023

Improved Deterministic Leader Election in Diameter-Two Networks.
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

Fault-Tolerant Dispersion of Mobile Robots.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2023

Run for Cover: Dominating Set via Mobile Agents.
Proceedings of the Algorithmics of Wireless Networks - 19th International Symposium, 2023

2022
Dispersion of mobile robots using global communication.
J. Parallel Distributed Comput., 2022

Greedy routing and the algorithmic small-world phenomenon.
J. Comput. Syst. Sci., 2022

Byzantine Connectivity Testing in the Congested Clique.
Proceedings of the 36th International Symposium on Distributed Computing, 2022

Dispersion of Mobile Robots.
Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

Message Complexity of Multi-Valued Implicit Agreement with Shared Random Bits.
Proceedings of the ICDCN '22: 23rd International Conference on Distributed Computing and Networking, Delhi, AA, India, January 4, 2022

Fault-Tolerant Graph Realizations in the Congested Clique.
Proceedings of the Algorithmics of Wireless Networks, 2022

2021
Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots.
Theor. Comput. Sci., 2021

Min-Max Gathering of Oblivious Robots.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Byzantine Agreement and Leader Election: From Classical to the Modern.
Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Weak Amnesiac Flooding of Multiple Messages.
Proceedings of the Networked Systems - 9th International Conference, 2021

Weak Amnesiac Flooding.
Proceedings of the 20th International Symposium on Parallel and Distributed Computing, 2021

Byzantine Dispersion on Graphs.
Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

2020
The cost of global broadcast in dynamic radio networks.
Theor. Comput. Sci., 2020

Economy Versus Disease Spread: Reopening Mechanisms for COVID 19.
CoRR, 2020

Efficient Dispersion on an Anonymous Ring in the Presence of Byzantine Robots.
CoRR, 2020

Scalable and Secure Computation Among Strangers: Message-Competitive Byzantine Protocols.
Proceedings of the 34th International Symposium on Distributed Computing, 2020

Dispersion of Mobile Robots on Grids.
Proceedings of the WALCOM: Algorithms and Computation - 14th International Conference, 2020

Smoothed Analysis of Leader Election in Distributed Networks.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Efficient Distributed Algorithms for the K-Nearest Neighbors Problem.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Efficient Dispersion of Mobile Robots on Dynamic Graphs.
Proceedings of the 40th IEEE International Conference on Distributed Computing Systems, 2020

Dispersion of Mobile Robots in the Global Communication Model.
Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

Efficient Dispersion on an Anonymous Ring in the Presence of Weak Byzantine Robots.
Proceedings of the Algorithms for Sensor Systems, 2020

Live Exploration with Mobile Robots in a Dynamic Ring, Revisited.
Proceedings of the Algorithms for Sensor Systems, 2020

2019
Optimal deterministic distributed algorithms for maximal independent set in geometric graphs.
J. Parallel Distributed Comput., 2019

Scalable and Secure Computation Among Strangers: Resource-Competitive Byzantine Protocols.
CoRR, 2019

Dispersion of Mobile Robots: The Power of Randomness.
Proceedings of the Theory and Applications of Models of Computation, 2019

Efficient Distributed Community Detection in the Stochastic Block Model.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

The Communication Cost of Information Spreading in Dynamic Networks.
Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, 2019

Fast Dispersion of Mobile Robots on Arbitrary Graphs.
Proceedings of the Algorithms for Sensor Systems, 2019

2018
Improved Dispersion of Mobile Robots on Arbitrary Graphs.
CoRR, 2018

Sublinear Message Bounds for Randomized Agreement.
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, 2018

Local Mixing Time: Distributed Computation and Applications.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

2017
Distributed Computation of Mixing Time.
Proceedings of the 18th International Conference on Distributed Computing and Networking, 2017

2016
Greedy Routing and the Algorithmic Small-World Phenomenom.
CoRR, 2016

2015
Fast distributed PageRank computation.
Theor. Comput. Sci., 2015

Distributed computation in dynamic networks via random walks.
Theor. Comput. Sci., 2015

Efficient random walk sampling in distributed networks.
J. Parallel Distributed Comput., 2015

Distributed Sparse Cut Approximation.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

Distributed Computation of Sparse Cuts via Random Walks.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

2013
Distributed Computation of Sparse Cuts.
CoRR, 2013

Storage and search in dynamic peer-to-peer networks.
Proceedings of the 25th ACM Symposium on Parallelism in Algorithms and Architectures, 2013

2012
Fast Distributed Computation in Dynamic Networks via Random Walks.
Proceedings of the Distributed Computing - 26th International Symposium, 2012

Near-optimal random walk sampling in distributed networks.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012


  Loading...