Publications

Tight lower bounds for algebraic communication and applications

with Manon Blanc, Magnus Rahbek Dalgaard Hansen, Nutan Limaye, and Meena Mahajan

Manuscript

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials

with Benedikt Pago and Tim Seppelt

STOC 2026 · Symposium on Theory of Computing

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs

with Robert Andrews, Jules Armand, Magnus Hansen, Nutan Limaye, Srikanth Srinivasan, and Sébastien Tavenas

ITCS 2026 · Innovations in Theoretical Computer Science

A primer on the closure of algebraic complexity classes under factoring

with C. S. Bhargav and Nitin Saxena

Survey

Monotone Bounded-Depth Complexity of Homomorphism Polynomials

with C. S. Bhargav, Shiteng Chen, and Radu Curticapean

MFCS 2025 · Mathematical Foundations of Computer Science

Treading the Borders for Explicitness, Circuit Factoring, and Identity Testing

PhD thesis

Learning the coefficients: A presentable version of border complexity and applications to circuit factoring

with C. S. Bhargav and Nitin Saxena

STOC 2024 · Symposium on Theory of Computing

Lower Bounds for the Sum of Small-Size Algebraic Branching Programs

with C. S. Bhargav and Nitin Saxena

TAMC 2024 · Theory and Applications of Models of Computation

TCS · Theoretical Computer Science · Invited to the special issue

Demystifying the border of depth-3 algebraic circuits

with Pranjal Dutta and Nitin Saxena

FOCS 2021 · Foundations of Computer Science

SICOMP · SIAM Journal on Computing · Invited to the special issue

Deterministic identity testing paradigms for bounded top-fanin depth-4 circuits

with Pranjal Dutta and Nitin Saxena

CCC 2021 · Computational Complexity Conference

ToC 2026 · Theory of Computing · To appear