Manish Kumar

Manish Kumar

Bar-Ilan University

Contact Me
I am a Post-Doctoral Researcher at Bar-Ilan University.

Before joining Bar-Ilan University, I submitted my thesis in the Department of Computer Science at Ben-Gurion University of the Negev, under the supervision of Prof. Shlomi Dolev. Before coming to Israel, I received a Master's degree from TU Kaiserslautern, and Master's thesis from Max Planck Institute for Software Systems, Kaiserslautern, Germany.

Research Interests

My research interests are:
  • Graph Algorithms, Combinatorial Reconfiguration
  • Theory of Distributed Computing, Self-Stabilization
  • Bio-inspired Algorithms
  • Computational Social Choice

Publications

(All publications are in alphabetical order of author's last name) DBLP, Google Scholar, ArXiv

Journal Papers

[1] Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs [Paper]
- Yefim Dinitz , Shlomi Dolev and Manish Kumar
- Theory of Computing Systems, 2022

Manuscripts

[1] Partially Disjoint k Shortest Paths
- Yefim Dinitz , Shlomi Dolev , Manish Kumar, and Baruch Schieber
- Arxiv Version

Conference Papers

[1] Reconfiguration and Locomotion with Joint Movements in the Amoebot Model
- Andreas Padalkin , Manish Kumar, and Christian Scheideler
- 40th European Workshop on Computational Geometry (EuroCG 2024)

[2] Brief Announcement: Distributed Reconfiguration of Spanning Trees
- Siddharth Gupta , Manish Kumar, and Shreyas Pai -24th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2022)

[3] Randomness for Randomness Testing
- Daniel Berend , Shlomi Dolev and Manish Kumar
- 6th International Symposium on Cyber Security Cryptology and Machine Learning (CSCML 2022)

[4] Reconfiguring Shortest Paths in Graphs [Paper]
- Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
- 36th AAAI Conference on Artificial Intelligence (AAAI 2022)
- Presented at Workshop on Combinatorial Reconfiguration, affiliated with ICALP 2021

[5] Polynomial Time k-Shortest Multi-Criteria Prioritized and All-Criteria-Disjoint Paths [Paper]
- Yefim Dinitz , Shlomi Dolev and Manish Kumar
- 5th International Symposium on Cyber Security Cryptology and Machine Learning (CSCML 2021)

[6] Brief Announcement: Local Deal-Agreement Based Monotonic Distributed Algorithms for Load Balancing in General Graphs [Paper]
- Yefim Dinitz , Shlomi Dolev and Manish Kumar
- 22nd International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2020)

Talks and Posters

Work Experience

Research Intern - SAP, Security Research Lab, Karlsruhe, Germany (Sept 2018 - Jan 2019)

Computation over Encrypted Data (Homomorphic Encyprtion)

Research Intern and Master's Thesis - Max Planck Institute for Software Systems, Kaiserslautern, Germany (Oct 2017 - Aug 2018)

Byzantine Fault-tolerance in Presence of Partial Synchrony

Working Student - SAP SE, St. Leon Rot, Germany (Aug 2016 - Jan 2017)

Projects

Performance Evaluation of Distributed Systems

Distributed Computer Systems Group, TU Kaiserslautern, Germany

Performance Evaluation of Classical Caching Policies (LRU, FIFO, GDSF, LFU-DA, GDS, S2LRU)
Github Repo

Proactive and Online Distributed Load Balancing

Department of Computer Science, Ben-Gurion University of the Negev, Israel