Manish Kumar

Orcid: 0000-0002-0414-7910

Affiliations:
  • Indian Institute of Technology Madras, Chennai, India
  • Indian Statistical Institute, Kolkata, India (former)


According to our database1, Manish Kumar authored at least 26 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Distributed Download from an External Data Source in Asynchronous Faulty Settings.
CoRR, September, 2025

Agentic Distributed Computing.
CoRR, July, 2025

Optimal Dispersion Under Asynchrony.
CoRR, July, 2025

Computing Tree Structures in Anonymous Graphs via Mobile Agents.
CoRR, June, 2025

Dispersion is (Almost) Optimal under (A)synchrony.
CoRR, March, 2025

Brief Announcement: Optimal Dispersion Under Asynchrony.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Brief Announcement: Distributed Download from an External Data Source in Asynchronous Faulty Settings.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Distributed Download from an External Data Source in Byzantine Majority Settings.
Proceedings of the 39th International Symposium on Distributed Computing, 2025

Dispersion is (Almost) Optimal under (A)synchrony.
Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, 2025

Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2025

Near-Linear Time Leader Election in Multiagent Networks.
Proceedings of the 24th International Conference on Autonomous Agents and Multiagent Systems, 2025

Optimal Fault-Tolerant Dispersion on Oriented Grids.
Proceedings of the 26th International Conference on Distributed Computing and Networking, 2025

Faster Leader Election and Its Applications for Mobile Agents with Parameter Advice.
Proceedings of the Distributed Computing and Intelligent Technology, 2025

2024
Distributed Download from an External Data Source in Faulty Majority Settings.
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

Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement.
Proceedings of the 25th International Conference on Distributed Computing and Networking, 2024

Optimizing Robot Dispersion on Unoriented Grids: With and Without Fault Tolerance.
Proceedings of the Algorithmics of Wireless Networks - 20th International Symposium, 2024

2023
On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement.
Proceedings of the 24th International Conference on Distributed Computing and Networking, 2023

Fault-Tolerant Graph Realizations in the Congested Clique, Revisited.
Proceedings of the Distributed Computing and Intelligent Technology, 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

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

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


  Loading...