Post Doctoral Fellow,
Theory Group at the Department of Computer Science and Engineering, IIT Delhi.,
Email: chaugule [AT] cse [DOT] iitd [DOT] ac [DOT] in, prasadvchaugule [AT] gmail [DOT] com
.
▶ Ph.D. Advisor: Nutan Limaye
▶ Research Area: Arithmetic circuit complexity
▶ Academic Background:
Ph.D., 2016-2023, Indian Institute of Technology, Bombay
M. Tech. (Computer Engineering), 2014-2016, VJTI, Mumbai
B. Tech , (Computer Engineering), 2008-2013, Dr. Babasaheb Ambedkar Technological University, Maharashtra
▶ TA Duties@IITB:
CS218 Design and Analysis of Algorithms, Jan 2020-April 2020 [Prof. Nutan Limaye] [Head TA]
CS721 Introduction to Computational Complexity, July 2019-Nov 2019 [Prof. Nutan Limaye]
CS601 Algorithms and Complexity, July 2018-Nov 2018 [Prof. Abhiram Ranade]
CS310 Automata Theory, Jan 2018-April 2018 [Prof. Nutan Limaye] [Head TA, TA of the month award]
CS601 Algorithms and Complexity, July 2017-Nov 2017 [Prof. Sundar Vishwanathan]
CS218 Design and Analysis of Algorithms, Jan 2017-April 2017 [Prof. Ajit Diwan]
▶ Teaching Experience:
I am one of the instructors for the summer course COL100: Introduction to Computers and Programming at IIT, Delhi (May-July 2025).
I was one of the instructors for the summer course COL100: Introduction to Computer Science at IIT, Delhi (May-July 2024).
I delivered one guest lecture for the course COL 863: Algebra and Computation (Topics in TCS) at IIT, Delhi.
I worked as an assistant professor at the Department of Information Technology, Shah and Anchor Kutchhi Engineering College, Mumbai, for 6 months (January 2023–June 2023).
▶ Academic visits:
IT University of Copenhagen, Denmark.
24th March 2025 to 28th March 2025.
Hosted by Nutan Limaye.
▶ Talks/Presentations:
Poster Presentation "A new characterization of VNP" at WACT, 2025.
Seminar Talk "Algebraic complexity classes and their characterisations" at IIT Delhi, November 2024.
An online talk on my thesis "Understanding the structure of VP and VNP" at Indian Institute of Technology, Delhi, October 2023.
Presented the paper titled "On the closures of monotone algebraic classes and variants of the determinant" at LATIN 2022, Mexico (online presentation).
Seminar Talk "On the closures of monotone algebraic classes and variants of the determinant" at Chennai Mathematical Institute, CMI, September 2022 (online presentation).
Presented the paper titled "Variants of the Determinant Polynomial and VP-completeness" at CSR 2021, Sochi, Russia (online presentation).
Presented the paper titled "Variants of Homomorphism polynomials complete for Algebraic Complexity Classes" at COCOON 2019, Xian, China.
Poster presentation titled "Variants of Homomorphism polynomials complete for Algebraic Complexity Classes" at RISC 2019, the Research and Innovation Symposium in Computing, Indian Institute of Technology, Bombay.
Poster Presentation titled "Variants of Homomorphism polynomials complete for Algebraic Complexity Classes" at CSA50—Pratitsha Trust Workshop on Theoretical Computer Science, Indian Institute of Science, 2nd and 3rd January, 2019.
▶ Publications:
Prasad Chaugule, Nutan Limaye: On the closures of monotone algebraic classes and variants of the determinant, The 15th Latin American Theoretical Informatics Symposium, LATIN 2022.
A full version (invited and) appeared in Algorithmica, 2024. https://doi.org/10.1007/s00453-024-01221-8. [ECCC]
Prasad Chaugule, Nutan Limaye, and Shourya Pandey: Variants of the Determinant Polynomial and the VP-Completeness, The 16th International Computer Science Symposium in Russia, CSR 2021. [ECCC]
Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan: Schur Polynomials Do Not Have Small Formulas If the Determinant Doesn't. Computational Complexity Conference(CCC) 2020.
A full version appeared in Computational Complexity, volume 32, number 1, pages 3, 2023. https://doi.org/10.1007/s00037-023-00236-x [ECCC][arXiv]
Prasad Chaugule, Nutan Limaye, Aditya Varre: Variants of Homomorphism Polynomials Complete for Algebraic Complexity Classes. The 25th International Computing and Combinatorics Conference (COCOON) 2019.
A full version appeared in ACM Transactions on Computation Theory, Volume 13, Issue 4, December 2021, Article No.: 21, pp 1-26, https://doi.org/10.1145/3470858 [ECCC]
▶ Articles:
Prasad Chaugule, A recursive solution to bicolor Towers of Hanoi problem, Recreational Mathematics Magazine(4), 2015, pp.37-48.
▶ Services:
Reviewer at Mathematical Reviews, AMS
Volunteer at FSTTCS 2024
Reviewer at ACM-ToCT
Worked in the organizing committee of FSTTCS 2019
▶ Attended Events:
WACT 2025, AdvancesInModernComplexityTheory2025, FSTTCS 2024, CSR 2021, CCC 2020, FSTTCS 2019, COCOON 2019, RISC 2019, CAALM 2019, CSA50 Pratiksha Trust Workshop on Theoretical Computer Science, IISc, Bangalore
Last updated: 5th June 2025.