Embedded Files
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.
News.
News.
PhD Position Available (Fully Funded)
We are advertising a funded PhD position jointly supervised by Dr. Swagato Sanyal and Prof. Or Meir at the University of Sheffield.
The project will study open questions in computational complexity theory, more specifically in Boolean function analysis, query complexity, communication complexity, and circuit complexity.
Application deadline: January 31, 2026.
Start date: February - April 2026.
Full details and application instructions are available here: https://www.findaphd.com/phds/project/computational-complexity-theory/?p193336
Page updated
Google Sites
Report abuse