Pranjal Dutta

Pranjal Dutta is an Assistant Professor in the College of Computing and Data Science (CCDS) at Nanyang Technological University (NTU), Singapore, joining in July 2025. He previously served as a Research Fellow at the School of Computing, National University of Singapore (NUS), funded by the National Research Foundation (NRF) Singapore from January 2023 to June 2025.

Education:

• Ph.D. in Computer Science, Chennai Mathematical Institute (CMI), 2018–2022
• M.Sc. in Computer Science, Chennai Mathematical Institute (CMI), 2016–2018
• B.Sc. in Mathematics and Computer Science, Chennai Mathematical Institute (CMI), 2013–2016

Pranjal's research lies at the heart of theoretical computer science, with a focus on computational complexity and computational algebra. He investigates fundamental questions about the power and limitations of algebraic computation, including derandomization, circuit lower bounds, and the role of approximations in complexity theory. His work bridges abstract mathematics with algorithmic design, particularly in algebraic models of computation.

His recent publications reflect a deep engagement with Polynomial Identity Testing (PIT), derandomization, and geometric complexity theory. The articles show a consistent trend toward understanding the structure of algebraic circuits, developing efficient algorithms for special circuit classes, and advancing the theoretical foundations of de-bordering in complexity theory.

Scientific Awards:

• ACM India Doctoral Dissertation Award 2023
• Google PhD Fellowship (2018–2022)
• Simons–Berkeley Research Fellowship (Fall 2025)

Pranjal has been supported by competitive fellowships and grants, including the Google PhD Fellowship and NRF funding during his postdoc. He advises and mentors students in theoretical computer science, though no current advisees are listed. He is an active peer reviewer, currently handling one journal and one conference paper.

He will be affiliated with the Simons Institute at UC Berkeley in Fall 2025 as a Jane Street Research Fellow, participating in the program on Complexity and Linear Algebra, indicating strong collaboration with leading international research teams.