• 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
  • 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
  • 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