Ankit Gupta


I am a post-doctoral researcher at Tel Aviv University working with Amir Shpilka.

I did my PhD in theoretical computer science at CMI and, before that, a bachelors in computer science at IIT Kanpur.


My research focuses on computational complexity theory and, more specifically, on arithmetic circuit complexity, derandomization and algorithmic algebra.

Email : ankitgupta (dot) iitkanpur (at) gmail (dot) com



Publications:


    Ankit Gupta
  • PhD Thesis. Chennai Mathematical Institute, 2015.

    Ankit Gupta
  • ECCC, 2014.

    Ankit Gupta, Pritish Kamath, Neeraj Kayal and Ramprasad Saptharishi
  • IEEE Symposium on Foundations of Computer Science (FOCS) 2013, pp. 578-587.
  • invited to special issue for FOCS 2013 in SIAM Journal on Computing.
  • invited to Communications of the ACM, Research Highlights.

    Ankit Gupta, Pritish Kamath, Neeraj Kayal and Ramprasad Saptharishi
  • IEEE Conference on Computational Complexity (CCC) 2013, pp. 65-73.
  • to appear in Journal of the ACM.
  • best paper award at CCC 2013.

5) "Random Arithmetic Formulas can be Reconstructed Efficiently",
    Ankit Gupta, Neeraj Kayal and Youming Qiao
  • IEEE Conference on Computational Complexity (CCC) 2013, pp. 1-9.
  • invited to special issue for CCC 2013 in Computational Complexity journal.

6) "Reconstruction of Depth-4 Multilinear Circuits with Top Fan-in 2",
    Ankit Gupta, Neeraj Kayal and Satya Lokam
  • ACM Symposium on Theory of Computing (STOC) 2012, pp. 625-642.

7) "Efficient Reconstruction of Random Multilinear Formulas",
    Ankit Gupta, Neeraj Kayal and Satya Lokam
  • IEEE Symposium on Foundations of Computer Science (FOCS) 2011, pp. 778-787.