On the symmetries of design polynomials. - Nikhil Gupta 008; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2018)

On the Symmetries of and Equivalence Test for Design Polynomials. - Nikhil Gupta 008; Chandan Saha 001 (MFCS, 2019)

Determinant equivalence test over finite fields and over ℚ. - Ankit Garg; Nikhil Gupta 008; Neeraj Kayal; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2019)

A Super-Quadratic Lower Bound for Depth Four Arithmetic Circuits. - Nikhil Gupta 008; Chandan Saha 001; Bhargav Thankey (Electron. Colloquium Comput. Complex., 2020)

Equivalence Test for Read-Once Arithmetic Formulas. - Nikhil Gupta 008; Chandan Saha 001; Bhargav Thankey (Electron. Colloquium Comput. Complex., 2022)

Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae. - Pranav Bisht; Nikhil Gupta 008; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2023)

Launching Identity Testing into (Bounded) Space. - Pranav Bisht; Nikhil Gupta 008; Prajakta Nimbhorkar; Ilya Volkovich (Electron. Colloquium Comput. Complex., 2024)