Nikhil S. Mande

About me

I am a postdoctoral researcher in the Algorithms and Complexity Group at CWI, and am hosted by Ronald de Wolf. Before this, I was a postdoctoral researcher in the Department of Computer Science at Georgetown University, where I was hosted by Justin Thaler.

Before that, I was a research scholar in the School of Technology and Computer Science at TIFR Mumbai, where Arkadev Chattopadhyay was my advisor. A bio (last updated August 2022) can be found here.


  • Ph.D. in Computer Science in 2018 from the Tata Institute of Fundamental Research, Mumbai.
  • M.Sc. in Applications of Mathematics (with a specialization in Computational Mathematics) in 2013 from Chennai Mathematical Institute, Chennai
  • B.Math. (Hons.) in 2010 from Indian Statistical Institute, Bangalore

    Research interests

    I am broadly interested in the area of computational complexity theory. More specifically, I have an interest in (classical and quantum)(query complexity and communication complexity), approximation theory, quantum computing, Boolean circuit complexity, and the connections between them.

    Theses and projects


    All of my papers are available in the public domain: either on arXiv, or on ECCC, or on both.


    Extracurricular activities


    Email: nikhil DOT s DOT mande AT gmail DOT com


    Google Scholar.
    ECCC Fixes, an amazing extension by Suhail Sherif that opens ECCC PDF's in browser rather than downloading them, and also handles a bug in the report submission process. Also available for Firefox.
    Interested in theoretical computer science research in Amsterdam? Check out this website.
    Google scholar links of my mother, my father. Fun fact: All three of us have an Erdős number of 3 (under a liberal definition of Erdős number).
    I no longer maintain my old website.