Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Manish Kumar
Observed names:
Kumar, Manish,
M. Amareswara Kumar,
M. Kumar
Institutions:
Indian Institute of Technology Ropar,
Indian Institute of Technology Dhanbad,
Indian Institute of Technology Madras
Observed institutions:
Indian Institute of Technology Ropar,
Wayne State University,
Indian Institute of Technology Dhanbad,
Indian Institute of Technology Madras,
Indian Statistical Institute
ORCID:
0000-0002-0414-7910
Observed ORCID:
0000-0002-0414-7910
OpenAlex ID:
A5006344213
Efficient data aggregation middleware for wireless sensor networks
2005
·
M. Kumar
, L. Schwiebert
, et al.
·
IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS)
·
26
Key distribution scheme for preventing key reinstallation attack in wireless networks
2024
·
Farooq Sunar Mahammad
, V. Madhu Viswanatham
, et al.
·
AIP conference proceedings
·
18
Fault-Tolerant Dispersion of Mobile Robots
2023
·
Prabhat Kumar Chand
, Manish Kumar
, et al.
·
Lecture notes in computer science
·
11
PDF
Optimal Fault-Tolerant Dispersion on Oriented Grids
2025
·
Rik Banerjee
, Manish Kumar
, et al.
·
International Conference on Distributed Computing and Networking (ICDCN)
·
9
Dispersion is (Almost) Optimal under (A)synchrony
2025
·
Ajay D. Kshemkalyani
, Manish Kumar
, et al.
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
·
7
PDF
Optimizing Robot Dispersion on Unoriented Grids: With and Without Fault Tolerance
2024
·
Rik Banerjee
, Manish Kumar
, et al.
·
Lecture notes in computer science
·
6
PDF
On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement
2023
·
Manish Kumar
, Anisur Rahaman Molla
·
IEEE Transactions on Parallel and Distributed Systems
·
5
Brief Announcement: On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement
2021
·
Manish Kumar
, Anisur Rahaman Molla
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
5
Sublinear Message Bounds of Authenticated Implicit Byzantine Agreement
2024
·
Manish Kumar
, Anisur Rahaman Molla
·
International Conference on Distributed Computing and Networking (ICDCN)
·
4
PDF
Fault-Tolerant Graph Realizations in the Congested Clique
2022
·
Manish Kumar
, Anisur Rahaman Molla
, et al.
·
Lecture notes in computer science
·
4
PDF
Distributed download from an external data source in Byzantine majority settings
2026
·
John Augustine
, Soumyottam Chatterjee
, et al.
·
Distributed Computing
·
3
PDF
Agent-Driven BFS Tree in Anonymous Graphs with Applications
2024
·
Prabhat Kumar Chand
, Manish Kumar
, et al.
·
Lecture notes in computer science
·
3
Energy Efficient Routing In Wireless Sensor Networks
·
M. Amareswara Kumar
, K. B. Pullama
, et al.
·
3
Faster Leader Election and Its Applications for Mobile Agents with Parameter Advice
2024
·
Ajay D. Kshemkalyani
, Manish Kumar
, et al.
·
Lecture notes in computer science
·
2
Babycare warning system based on IoT and GSM to prevent leaving a child in a parked car
2024
·
M. Amareswara Kumar
, Farooq Sunar Mahammad
, et al.
·
AIP conference proceedings
·
2
Fault-Tolerant Graph Realizations in the Congested Clique, Revisited
2023
·
Manish Kumar
·
Lecture notes in computer science
·
2
Computing Tree Structures in Anonymous Graphs via Mobile Agents
2025
·
Prabhat Kumar Chand
, Manish Kumar
, et al.
·
Lecture notes in computer science
·
1
PDF
Brief Announcement: Distributed Download from an External Data Source in Byzantine Majority Settings
2025
·
John Augustine
, Soumyottam Chatterjee
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
1
PDF
Sublinear message bounds of authenticated implicit Byzantine agreement
2024
·
Manish Kumar
, Anisur Rahaman Molla
·
Theoretical Computer Science
·
1
Improved Deterministic Leader Election in Diameter-Two Networks
2023
·
Manish Kumar
, Anisur Rahaman Molla
, et al.
·
Lecture notes in computer science
·
1
PDF
On the Message Complexity of Fault-Tolerant Computation: Leader Election and Agreement
2023
·
Manish Kumar
, Anisur Rahaman Molla
·
International Conference on Distributed Computing and Networking (ICDCN)
·
1
PDF
Asynchronous Dispersion with Optimal Time Complexity
2026
·
Debasish Pattanayak
, Ajay D. Kshemkalyani
, et al.
·
Proceedings of the International Conference on Parallel Processing
CoBLOC - Continuous Block Level Fairness on Data Streams
2026
·
Subhodeep Ghosh
, Zhihui Du
, et al.
·
Proceedings of the VLDB Endowment
Brief Announcement: Asynchronous Dispersion with Optimal Time Complexity
2026
·
Debasish Pattanayak
, Ajay Kshemkalyani
, et al.
·
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers
2026
·
John Augustine
, Henning Hillebrandt
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
Show more works
View as search
Works count:
32
Citation count:
171
H-index:
7
I10-index:
5
Year
Topic
Type