About
I am a Ph.D. student at the Department of Computer Science, Boston University, in the Theoretical Computer Science (TCS) research group, where I am advised by Prof. Sofya Raskhodnikova. I completed my undergraduate degree in mathematics and computer science at Chennai Mathematical Institute.
My research focuses on computational complexity and property testing. In property testing, I like to work on query and time complexity lower bounds, though our insights sometimes lead to new upper bounds instead. I am interested in investigating gaps between the information-theoretic (query complexity) and computational (time complexity) bounds on learning and testing problems. In complexity theory, I'm working on formalising relativisation to better understand it as a proof barrier and proof technique.
Properties tested
- halfspaces
- unate functions
- k-submodular functions
- lipschitz functions
- parenthesis languages
- connected graphs
- k-edge-connected graphs