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

Hitting Sets for Orbits of Circuit Classes and Polynomial Families. - Chandan Saha 001; Bhargav Thankey (Electron. Colloquium Comput. Complex., 2021)

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

Low-depth arithmetic circuit lower bounds via shifted partials. - Prashanth Amireddy; Ankit Garg; Neeraj Kayal; Chandan Saha 001; Bhargav Thankey (Electron. Colloquium Comput. Complex., 2022)

Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. - Prashanth Amireddy; Ankit Garg; Neeraj Kayal; Chandan Saha 001; Bhargav Thankey (ICALP, 2023)

BrakingBase - a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme. - Vineet Nair; Ashish Sharma; Bhargav Thankey (IACR Cryptol. ePrint Arch., 2024)