Ph.D., Department of Computer Science and Engineering, IIT Madras (2021 - present)
Ph.D., Department of Computer Science and Engineering, IIT Madras (2021 - present)
I work in Algorithms and Space Complexity Theory. My current work studies the Reachability problem using graph labellings and algebraic structures, in connection with the complexity classes NL, UL, and L, as well as related graph-theoretic and combinatorial problems.
On the Reachability on Monoid-labelled Undirected Graphs
Nagashri Krishnakumar, Harshil Mittal, Jayalal Sarma
Proceedings of the 22nd International Conference on Relational and Algebraic Methods in Computer Science (RAMICS 2026)
Enhanced K-Means++ Using Probability Theory for Efficient Prediction of Air Pollution
Chetan Shetty, Sowmya B. J., S. Seema, Nagashri K
International Journal of Advanced Computer Science and Applications, Vol. 19, No. 2, pp. 2437–2468, 2022
Collection and Analysis of Big Data from Emerging Technologies in Healthcare
Nagashri K, D. S. Jayalakshmi, J. Geetha
Bioinformatics and Medical Applications: Big Data Using Deep Learning Algorithms, Chapter 13, 2022
Fake News Detection Using Passive-Aggressive Classifier and Other Machine Learning Algorithms
Nagashri K, Sangeetha J.
Advances in Computing and Network Communications, Lecture Notes in Electrical Engineering, pp. 221–233, 2021
(Board) Talk titled "Solving Big Mazes in Small Space - A Monoid Labelling Approach"
Based on the paper — On the Reachability Problem on Monoid-Labelled Undirected Graphs
Joint work with Harshil Mittal and Jayalal Sarma
University of Warsaw, Poland — April 2026
Presentation on the paper — On the Reachability Problem on Monoid-Labelled Undirected Graphs
Joint work with Harshil Mittal and Jayalal Sarma
22nd International Conference Relational and Algebraic Methods in Computer Science (RAMiCS 2026), Bedlewo, Poland — April 2026
Talk titled — Solving Big Mazes in Small Space - A Monoid Labelling Approach
Based on the paper — On the Reachability Problem on Monoid-Labelled Undirected Graphs
Joint work with Harshil Mittal and Jayalal Sarma
Theory Meeting, IIT Madras — February 2026
Talk titled "Reachability on Monoid-labelled Undirected Graphs"
Based on the paper — On the Reachability Problem on Monoid-Labelled Undirected Graphs
Joint work with Harshil Mittal and Jayalal Sarma
Seminar, IIT Madras — October 2025
(Board) Talk on the paper — Deciding Reachability in a Directed Graph given its Path Decomposition
Work by Ronak Bhadra, Raghunath Tewari
Complexity Theory Meeting, IIT Madras — October 2024
(Board) Talk on the paper — The Space Complexity of Sum Labelling
Work by Henning Fernau, Kshitij Gajjar
Complexity Theory Meeting, IIT Madras — February 2023
Attended the Advances in Modern Complexity Theory Workshop
The Institute of Mathematical Sciences (IMSc), Chennai, India — Jan 2025, Jan 2026
Attended the Technical and Scientific Writing Workshop
IIT Madras, Chennai, India — July 2023
Participated and volunteered at the Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
IIT Madras, Chennai, India — Dec 2022
Attended and volunteered at the Algorithms Under Uncertainty Workshop
IIT Madras, Chennai, India — Dec 2022
Attended the ACM India Winter School on Algorithms and Lower Bounds Workshop
IIT Madras and the Chennai Mathematical Institute (CMI), Chennai, India — Jan 2022