Deterministic Identity Testing Paradigms for Bounded Top-Fanin Depth-4 Circuits. - Pranjal Dutta; Prateek Dwivedi 001; Nitin Saxena 001 (CCC, 2021)

Demystifying the border of depth-3 algebraic circuits. - Pranjal Dutta; Prateek Dwivedi 001; Nitin Saxena 001 (FOCS, 2021)

Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring. - C. S. Bhargav; Prateek Dwivedi 001; Nitin Saxena 001 (STOC, 2024)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials. - C. S. Bhargav; Shiteng Chen; Radu Curticapean; Prateek Dwivedi 001 (MFCS, 2025)

A primer on the closure of algebraic complexity classes under factoring. - C. S. Bhargav; Prateek Dwivedi 001; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2025)

Lower bounds for the sum of small-size algebraic branching programs. - C. S. Bhargav; Prateek Dwivedi 001; Nitin Saxena 001 (Theor. Comput. Sci., 2025)