Hello! I’m Chandrima, currently a CNRS Postdoctoral Fellow at IRIF (Institut de Recherche en Informatique Fondamentale), France, where I am a member of the Algorithms and Complexity Group. Prior to joining IRIF, I spent nearly a year at the Institute of Mathematical Sciences (IMSc), Chennai. I received my Ph.D. from the Indian Statistical Institute (ISI), Kolkata, under the supervision of Prof. Sourav Chakraborty, and defended my doctoral thesis on October 30, 2024.
Embedded Files
My research focuses on the complexity of Boolean functions, with particular emphasis on combinatorial complexity measures and their applications in theoretical computer science. During my Ph.D., I worked extensively with polynomial and dual polynomial methods, as well as with combinatorial approaches to understanding the complexity of Boolean functions. More recently, my work has involved Fourier-analytic techniques and their applications to problems in property testing and learning theory. I am currently interested in quantum lower bounds for property testing and related questions at the interface of quantum computing and complexity theory. More broadly, I enjoy learning ideas from adjacent areas, and exploring connections between different parts of theoretical computer science.
Page updated
Google Sites
Report abuse