All papers are available in the public domain: either on arXiv, or on ECCC, or on both. A full list of publications can be found on his personal website.
Research Experience
Lecturer at the University of Liverpool since January 2023; Postdoctoral researcher at the Algorithms and Complexity Group, CWI, hosted by Ronald de Wolf until December 2022; Postdoctoral researcher at the Department of Computer Science, Georgetown University, hosted by Justin Thaler before that; Research scholar at the School of Technology and Computer Science, TIFR Mumbai, advised by Arkadev Chattopadhyay.
Education
Ph.D. in Computer Science from Tata Institute of Fundamental Research, Mumbai, in 2018, awarded TAA-Sasken Best Thesis Award for 2018-2019; M.Sc. in Applications of Mathematics (specialization in Computational Mathematics) from Chennai Mathematical Institute, Chennai, in 2013, awarded CMI Gold Medal of Excellence; B.Math. (Hons.) from Indian Statistical Institute, Bangalore, in 2010.
Background
Lecturer (Assistant Professor) in the School of Computer Science and Informatics at the University of Liverpool. Broadly interested in computational complexity theory, with specific interests in (classical and quantum) query and communication complexity, analysis of Boolean functions, approximation theory, quantum computing, and Boolean circuit complexity, and their connections.
Miscellany
Teaching and supervision: Currently supervises Joe Morris and Taha Abdlsalam for their PhDs, co-supervising Ziad Ismaili Alaoui. Involved in teaching and project supervision at the University of Liverpool, including courses such as Complexity of Algorithms, Communicating Computer Science, and more.