I am currently employed as a Research Fellow in the Algorithms, Complexity Theory and Optimization group at the University of Liverpool. I am hosted by Sebastian Wild under his EPSRC grant Computing over Compressed Graph-Structured Data.
Previously, I was a PhD student in the Division of Theory and Foundations (FoCS) and the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick. I was advised by Torsten Mütze and my research was supported by the Chancellor's International Scholarship.
Before joining Warwick, I graduated with an MSc degree in Theoretical Computer Science from Chennai Mathematical Institute, India, where I was advised by Partha Mukhopadhyay. During my master's, I was also a research intern at Sorbonne University, Paris, where I was hosted by Vincent Cohen-Addad.
Before delving into academia, I worked as a software developer for five years at Oracle Corporation.
Research Interests
I am broadly interested in problems originating from combinatorics and algorithms. My PhD was in enumerative combinatorics, where the goal is to exhaustively generate various combinatorial objects. I aim to generate such objects efficiently using Gray codes. The research during my PhD revolved around objects defined by intersecting set systems. I also studied combinatorial properties of classical objects characterized by pattern avoidance. Additionally, I have undertaken research in the fields of algorithmic fairness.
Currently, I am learning about compressed data structures, specifically graph-structured data. I study how to answer queries on a compressed representation so that we can make effective use of its compressibility while querying over a graph-structured dataset. I am also interested in designing lower bounds for Quantum algorithms.