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, Pritish Kamath, Neeraj Kayal and Ramprasad Saptharishi
  • Communications of the ACM, 60(6): 93-100 (2017).

    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.
  • SIAM Journal on Computing, 45(3): 1064-1079 (2016) (special issue for FOCS)
  • 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.
  • Journal of the ACM, 61(6): 33:1-33:16 (2014)
  • best paper award at CCC 2013.

6) "Random Arithmetic Formulas can be Reconstructed Efficiently",
    Ankit Gupta, Neeraj Kayal and Youming Qiao
  • IEEE Conference on Computational Complexity (CCC) 2013, pp. 1-9.
  • Computational Complexity 23(2): 207-303 (2014) (special issue for CCC 2013) 

7) "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.

8) "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.