I think about graphs, computational complexity, and what it means to build knowledge, whether in a Turing machine or a classroom.
I am doing my MS by Research at IIT Palakkad, advised by Dr. Krishnamoorthy Dinesh. During this programme, I spent the better part of my time doing mental gynmanstics over where the complexity of reachability problems for restricted graphs lies, especially in the logspace setting.
Before this, I studied public policy at IIT Bombay, advised by Dr. Prabhir Vishnu Poruthiyil, with a focus on education policy, media literacy and political discourse. I worked on comparative study of media literacy curricula across Finland, Ukraine, and Kerala, tracing learning objectives, pedagogical choices, and approaches to misinformation. I am drawn to questions at both ends of the spectrum, the rigorous formalism of complexity theory and the craft of policies that shape how people learn and think.
How much space a TM needs to decide reachability in graphs, and how restricting a graph's structure can reduce that space requirement.
Particularly interested in the logspace complexity of reachability for restricted graph classes (simple path, chordal, and perfect graphs), with recognition as a necessary first step.
How educational systems are designed, who they reach, and how technology mediates (or disrupts) the transfer of knowledge.
Particularly interested in media literacy education, technology-mediated education, and what rigorous pedagogy looks like at scale.
Things I think about when I'm not thinking about complexity theory or pedagogy.