Ninad Rajgopal

Hi everyone! I am a post-doctoral researcher in the Center for Foundations of Contemporary Computer Science group at Charles University where I am fortunate to be working with Michal Koucký. Prior to this I was a post-doctoral researcher in the Algorithms and Complexity group at the University of Cambridge, as well as the Theory and Foundations group and the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick, hosted by Tom Gur (in both places).

My research interests are broadly in Computational Complexity Theory. In particular, I am currently interested in probabilistic proof systems, computational learning theory, circuit complexity, meta-complexity, and pseudorandomness.

I did my D.Phil at the Algorithms and Complexity Theory group in the University of Oxford, advised by Rahul Santhanam. Before this, I did my Master’s degree at the Computer Science and Automation department in the Indian Institute of Science, Bengaluru, and my undergraduate degree was at the Computer Science department in Sri Jayachamarajendra College of Engineering (SJCE), Mysuru.

[DBLP] [Google Scholar]