On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
with Jules Armand, Magnus Hansen, Nutan Limaye, Srikanth Srinivasan, and Sébastien Tavenas Submitted, 2025 Paper
A primer on the closure of algebraic complexity classes under factoring
with C. S. Bhargav and Nitin Saxena To appear in the proceedings of Recent Trends in Computer Algebra (RTCA), 2025 Survey
Monotone Bounded-Depth Complexity of Homomorphism Polynomials
with C. S. Bhargav, Shiteng Chen, Radu Curticapean 50th International Symposium on Mathematical Foundations of Computer Science (MFCS), 2025 Paper | Slides
Treading the Borders for Explicitness, Circuit Factoring, and Identity Testing
Learning the coefficients: A presentable version of border complexity and applications to circuit factoring
with C. S. Bhargav and Nitin Saxena 56th Annual ACM Symposium on Theory of Computing (STOC), 2024 Paper | Video
Lower Bounds for the Sum of Small-Size Algebraic Branching Programs
with C. S. Bhargav and Nitin Saxena 19th Annual Conference of Theory and Applications of Models of Computation (TAMC), 2024 Invited in the special issue of Theoretical Computer Science(Theor. Comput. Sci.) Paper | Full Version
Demystifying the border of depth-3 algebraic circuits
with Pranjal Dutta and Nitin Saxena 62nd Annual Symposium on Foundations of Computer Science (FOCS), 2021 Invited in the special issue of SIAM Journal on Computing (SICOMP) Paper | Full Version | Video
Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits
with Pranjal Dutta and Nitin Saxena 36th Computational Complexity Conference (CCC), 2021 Paper | Full Version | Video