Rules: 

1. Publication numbering is in the reverse chronological order.

2. [Pi] refers to the i-th publication.

3. [Ci] refers to the i-th peer-reviewed conference publication.

4. [Ji] refers to the i-th peer-reviewed journal publication.

5. The order of authorship is alphabetical.

6. If the full version of a conference publication has been published in a journal, then it has been put under a single publication with the appropriate numbering.  
   
   

Publication List:

[P26] On the Border Complexity of Sums of ROFs [pdf].

• Joint work with Bhargav Thankey (Arithmic Labs).

• Submitted.

[P25] Weak Pigeonhole Equal-Sums made Simpler and Faster [pdf].

• Joint work with Deepak Bhati (CISPA), Antoine Joux (CISPA), Mahesh Sreekumar Rajasree (CISPA), and Karol Węgrzycki (Max-Planck-Institut für Informatik).

• Submitted.

[P24] The Complexity of Order-Finding for ROABPs [pdf].

• Joint work with Vishwas Bhargava (Caltech), Sumanta Ghosh (ISI Kolkata), and Anamay Tengse (NISER).

• Submitted.

[P23] Geometric complexity theory for product-plus-power [pdf].

• Joint work with Fulvio Gesmundo (Paul Sabatier University), Christian Ikenmeyer (University of Warwick), Gorav Jindal (University of Warsaw), and Vladimir Lysikov (Ruhr-Universität Bochum).

• [J5] Special issue on the topics of MEGA 2024 (Effective Methods in Algebraic Geometry), Journal of Symbolic Computation (J. Symb. Comput), Volume 132, 2026.

[P22] Efficient strong 2-source non-malleable extractor for any linear min-entropy [pdf].

• Joint work with Divesh Aggarwal (NUS),  Saswata Mukherjee (NUS), Satyajeet Nagargoje (Georgetown University), and Maciej Obremski (NUS).

• [C21] In the Proceedings of the 45th Annual International Cryptology Conference (CRYPTO 2025).

[P21] Algebraic metacomplexity and representation theory [pdf].

• Joint work with Maxim van den Berg (Ruhr-Universität Bochum),  Fulvio Gesmundo (Paul Sabatier University), Christian Ikenmeyer (University of Warwick), and Vladimir Lysikov (Ruhr-Universität Bochum).

• [C20] In the Proceedings of the 40th Computational Complexity Conference (CCC 2025)

[P20] Improved Lower Bounds for 3-Query Matching Vector Codes [pdf].

• Joint work with Divesh Aggarwal (NUS), Zeyong Li (NUS), Maciej Obremski (NUS), Sidhant Saraogi (Georgetown University).

• [C19] In the Proceedings of the 16th Innovations in Theoretical Computer Science (ITCS 2025).

[P19] Complexity of Monomial Prediction in Cryptography and Machine Learning [pdf].

• Joint work with Mahesh S. Rajasree (IIT Delhi) and Santanu Sarkar (IIT Madras).

• [C18] In the Proceedings of the IEEE 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2024).

[P18] Derandomizing Multivariate Polynomial Factoring for Low Degree Factors [pdf].

• Joint work with  Amit Sinhababu (CMI), and Thomas Thierauf (Aalen University).

• [C17] In the Proceedings of the 28th International Conference on Randomization and Computation (RANDOM 2024).

• Invited  in the Theory of Computing (ToC) Special Issue on APPROX/RANDOM 2024.

• Presented at the Highlights of Algorithms (HALG 2025).

[P17] On Fourier analysis of sparse Boolean functions over certain Abelian groups [pdf].

•  With Arijit Ghosh (ISI Kolkata), Swagato Sanyal (IIT Kharagpur), Swarnalipa Datta (ISI Kolkata), and Sourav Chakraborty (ISI Kolkata).

• [C16] In the Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science (MFCS 2024).

[P16] Exponential lower bounds via exponential sums [pdf].

• Joint work with Markus Blaser (Saarland University),  Somnath Bhattacharjee (CMI), and Saswata Mukherjee (CMI).

• [C15] In the Proceedings of the 51st EATCS International Colloquium on Automata, Languages and Programming (ICALP 2024).

[P15] On the power of border width-2 ABPs over fields of characteristic 2 [pdf].

• Joint work with Christian Ikenmeyer (University of Warwick), Balagopal Komarath (IIT Gandhinagar), Harshil Mittal (IIT Gandhinagar),  Saraswati Girish Nanoti (IIT Gandhinagar), and  Dhara Thakkar (IIT Gandhinagar).

• [C14] In the Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024).

[P14] Fixed-parameter debordering of Waring rank [pdf].

• Joint work with Fulvio Gesmundo (Saarland University), Christian Ikenmeyer (University of Warwick), Gorav Jindal (Max Planck Institute for Software Systems, Saarbrücken), and Vladimir Lysikov (Ruhr-Universität Bochum).

• [C13] In the Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024).

[P13] Homogeneous algebraic complexity theory and algebraic formulas [pdf].

• Joint work with Fulvio Gesmundo (Saarland University), Christian Ikenmeyer (University of Warwick), Gorav Jindal (Max Planck Institute for Software Systems, Saarbrücken), and Vladimir Lysikov (Ruhr-Universität Bochum).

• [C12] In the Proceedings of the 15th Innovations in Theoretical Computer Science (ITCS 2024).

[P12] On the Variants of Subset Sum: Projected and Unbounded [pdf].

• • Joint work with Mahesh S. Rajasree (IIT Delhi).

  • [C11] In the Proceedings of the IEEE 25th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2023).

[P11] Efficient reductions and algorithms for Subset Product [pdf].

• Joint work with Mahesh S. Rajasree (IIT Kanpur).

• [C10] In the Proceedings of the 9th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2023). 

• One of the winners of the Springer Best Student Presentation Award.

• An extended version [pdf] is submitted.

[P10] Weak-keys and key-recovery attack for  TinyJAMBU [pdf].

• Joint work with Mahesh S. Rajasree (IIT Kanpur) and Santanu Sarkar (IIT Madras).

• [J4] Scientific Reports - Nature (2022), Volume- 12 (16313).

[P9] Separated borders: Exponential-gap  fanin-hierarchy theorem for approximative depth-3 circuits [pdf].

• Joint work with Nitin Saxena (IIT Kanpur).

• [C9] In the proceedings of the 63rd IEEE Symposium on Foundations of Computer Science (FOCS 2022).

[P8] On the hardness of monomial prediction and zero-sum distinguishers for Ascon [pdf].

• Joint work with Mahesh S. Rajasree (IIT Kanpur) and Santanu Sarkar (IIT Madras).

• [C8] In the proceedings of the 12th International Workshop on Coding and Cryptography (WCC 2022).

[P7] Algebraic algorithms for variants of Subset Sum [pdf].

• Joint work with Mahesh S. Rajasree (IIT Kanpur).

• [C7] In the proceedings of the 8th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2022).

• One of the 3 winners of the Springer Best Student Presentation Award.

[P6]  Demystifying the border of depth-3 algebraic circuits [pdf].

• Joint work with Prateek Dwivedi  (IIT Kanpur), and Nitin Saxena (IIT Kanpur).

• [C6] In the proceedings of the 62nd IEEE Symposium on Foundations of Computer Science (FOCS 2021).

• [J3] Invited in the SIAM Journal on Computing (SICOMP) Special Issue on FOCS 2021 [Full version].

[P5] Arithmetic Circuit Complexity of Division and Truncation [pdf].

• Joint work with Gorav Jindal (Institut für Mathematik,Technische Universität Berlin),  Anurag Pandey (Saarland University) and Amit Sinhababu (Aalen University).

• [C5] In the proceedings of the 36th Computational Complexity Conference (CCC 2021).

[P4] Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits [pdf].

• Joint work with Prateek Dwivedi  (IIT Kanpur) and Nitin Saxena (IIT Kanpur).

• [C4] In the proceedings of the 36th Computational Complexity Conference (CCC 2021).

• Extended version submitted [Full version].

[P3] Real  tau-Conjecture for sum-of-squares: A unified approach to lower bound and derandomization [pdf].

• [C3] In the proceedings of the 16th International Computer Science Symposium in Russia (CSR 2021).

• Won the Best Student Paper award and the Best Paper award.

• Invited  in the Theory of Computing Systems (ToCS) Special Issue on CSR'21 [Full version].

• Presented in the 16th Academic Research and Careers for Students Symposium (ARCS 2022).

[P2] A Largish Sum-of-squares Implies Circuit Hardness and Derandomization [pdf].

• Joint work with Nitin Saxena (IIT Kanpur), and Thomas Thierauf (Aalen University).

• [C2] In the proceedings of the 12th Innovations in Theoretical Computer Science (ITCS 2021) . Subsumes earlier version 1 and version 2.

• [J2] Full version [pdf] in the Journal of Computational Complexity; 2024.

[P1] Discovering the roots: Uniform closure results for algebraic classes under factoring [Conference version].

• Joint work with  Amit Sinhababu (IIT Kanpur), and Nitin Saxena (IIT Kanpur) .  

• [C1] In the proceedings of the 50th Annual ACM Symposium on the Theory of Computing (STOC 2018). 

• [J1] Full version in J.ACM 2022 [Full version].

Theses: 

2. A Tale of Hardness, De-randomization and De-bordering in Complexity Theory [pdf].

• Ph.D. Thesis, CMI.

• Advisor:  Nitin Saxena (IIT Kanpur).

• Won the ACM India 2023 Doctoral Dissertation Award.

1. Discovering the roots: Unifying and extending results on multivariate polynomial factoring in algebraic complexity [pdf].

• M.Sc. Thesis, CMI 2018. 

• Advisors: Nitin Saxena (IIT Kanpur), Partha Mukhopadhyay (CMI).

Surveys:

2. Recent Advances in Debordering Methods [pdf].

   1. With Vladimir Lysikov (Ruhr-Universität Bochum).

   2. Submitted in the Proceedings of the Workshop RTCA'23, IHP Paris (Invited by the editor)

1. Advances in Polynomial Identity Testing [pdf][Survey].

• With Sumanta Ghosh (CMI).

• SIGACT News, Complexity Theory Column (Invited by the Editor).

Unpublished:

2. A note on Faithful Coupling of Markov Chains [pdf]. 

• Joint work  with  Debojyoti Dey (IIT Kanpur), and Professor Emeritus  Somenath Biswas (IIT Kanpur), 2017.

• Unpublished.

1. Modular Inversion Hidden Number problem [pdf].

• International Association for Cryptologic Research (IACR) ePrint Archive, 2015.

• Unpublished.