I am a Lecturer of Algorithms at the School of Computer Science, University of Sheffield where I am part of the Foundations of Computation (FOX) research group. I am interested in theoretical computer science in general. My primary research interest lies in computational complexity theory, more specifically in Boolean function analysis, query and communication complexity. I have an emerging interest in computational social choice.
Prior to joining my current role, I have been an Assistant Professor at the Department of Computer Science and Engineering, Indian Institute of Technology Kharapur, India from 2018 to 2025. Before that I have been a post-doctoral research fellow at the Centre for Quantum Technologies, National University of Singapore and Nanyang Technological Institute, Singapore from 2017 to 2018. I completed my PhD in Computer Science from the School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India in 2017.
We are organising a one day workshop "Randomness in Computing" at the School of Computer Science, University of Sheffield on June 30. The workshop aims to bring together researchers in theoretical computer science working on randomness and its role in computation, including topics such as randomised algorithms, pseudorandomness, probabilistic methods, complexity theory, and related areas. The program includes talks by five invited speakers and a session of short talks by junior researchers. Registration is free but mandatory. More information, including registration details and instructions for expressing interest in giving a short talk, is available here.