- On the complexity of Compact Set r-Packing. [under submission], 2019.
- On learning k-parities with and without noise. with Arnab Bhattacharyya and Ninad Rajgopal. COCOON, 2018.
- On the hardness of learning sparse parities. with Arnab Bhattacharyya, Suprovat Ghoshal, and Rishi Saket. ESA, 2016.
- TA for Principles of Algorithmic Techniques by Parinya Chalermsook – Fall 2019, Fall 2018.
- TA for Design and Analysis of Algorithms by Arnab Bhattacharya and Sathish Govindarajan – Fall 2014.
- Real Analysis, Maths Department
- Computational Methods of Optimization by Chiranjib Bhattacharyya
- Foundations of Data Science by Ravi Kanan, Ramesh Hariharan and Navin Goyal
- Topics in Complexity Theory by Chandan Saha and Arnab Bhattacharyya
- Design and Analysis of Algorithms by Arnab Bhattacharya, Saurabh Ray and Sathish Govindarajan
- Linear Algebra and Applications by R. Vittal Rao
- Automata Theory and Computabilty by Deepak D Souza