Practical Algorithms for Tracking Database Join Sizes. - Sumit Ganguly; Deepanjan Kesh; Chandan Saha 001 (FSTTCS, 2005)

Simpler algorithm for estimating frequency moments of data streams. - Lakshminath Bhuvanagiri; Sumit Ganguly; Deepanjan Kesh; Chandan Saha 001 (SODA, 2006)

Factoring Polynomials over Finite Fields using Balance Test. - Chandan Saha 001 (STACS, 2008)

The Power of Depth 2 Circuits over Algebras. - Chandan Saha 001; Ramprasad Saptharishi; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2009)

Covering a set of points in a plane using two parallel rectangles. - Chandan Saha 001; Sandip Das 001 (Inf. Process. Lett., 2009)

On the Sum of Square Roots of Polynomials and related problems. - Neeraj Kayal; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2010)

Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant - Michael Forbes; Neeraj Kayal; Rajat Mittal 001; Chandan Saha 001 (CoRR, 2011)

Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. - Manindra Agrawal; Chandan Saha 001; Ramprasad Saptharishi; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2011)

Quasi-polynomial Hitting-set for Set-depth-$ Delta$ Formulas. - Manindra Agrawal; Chandan Saha 001; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2012)

Quasi-polynomial hitting-set for set-depth-Δ formulas. - Manindra Agrawal; Chandan Saha 001; Nitin Saxena 001 (STOC, 2013)

A Case of Depth-3 Identity Testing, Sparse Factorization and Duality. - Chandan Saha 001; Ramprasad Saptharishi; Nitin Saxena 001 (Comput. Complex., 2013)

A super-polynomial lower bound for regular arithmetic formulas. - Neeraj Kayal; Chandan Saha 001; Ramprasad Saptharishi (Electron. Colloquium Comput. Complex., 2013)

Fast Integer Multiplication Using Modular Arithmetic. - Anindya De; Piyush P. Kurur; Chandan Saha 001; Ramprasad Saptharishi (SIAM J. Comput., 2013)

Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. - Neeraj Kayal; Nutan Limaye; Chandan Saha 001; Srikanth Srinivasan 001 (STOC, 2014)

Lower Bounds for Sums of Powers of Low Degree Univariates. - Neeraj Kayal; Pascal Koiran; Timothée Pecatte; Chandan Saha 001 (ICALP (1), 2015)

Separation between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. - Neeraj Kayal; Vineet Nair; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2015)

Multi-k-ic depth three circuit lower bound. - Neeraj Kayal; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2015)

Lower Bounds for Sums of Products of Low arity Polynomials. - Neeraj Kayal; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2015)

On the size of homogeneous and of depth four formulas with low individual degree. - Neeraj Kayal; Chandan Saha 001; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2015)

Lower Bounds for Depth-Three Arithmetic Circuits with small bottom fanin. - Neeraj Kayal; Chandan Saha 001 (Comput. Complex., 2016)

An almost Cubic Lower Bound for Depth Three Arithmetic Circuits. - Neeraj Kayal; Chandan Saha 001; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2016)

Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. - Manindra Agrawal; Chandan Saha 001; Ramprasad Saptharishi; Nitin Saxena 001 (SIAM J. Comput., 2016)

Reconstruction of full rank Algebraic Branching Programs. - Neeraj Kayal; Vineet Nair; Chandan Saha 001; Sébastien Tavenas (Electron. Colloquium Comput. Complex., 2017)

Multi-k-ic Depth Three Circuit Lower Bound. - Neeraj Kayal; Chandan Saha 001 (Theory Comput. Syst., 2017)

An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. - Neeraj Kayal; Nutan Limaye; Chandan Saha 001; Srikanth Srinivasan 001 (SIAM J. Comput., 2017)

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

Reconstruction of non-degenerate homogeneous depth three circuits. - Neeraj Kayal; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2018)

Guest Column: A Paradigm for Arithmetic Circuit Lower Bounds. - Neeraj Kayal; Chandan Saha 001 (SIGACT News, 2018)

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

Average-case linear matrix factorization and reconstruction of low width algebraic branching programs. - Neeraj Kayal; Vineet Nair; Chandan Saha 001 (Comput. Complex., 2019)

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

Learning sums of powers of low-degree polynomials in the non-degenerate case. - Ankit Garg; Neeraj Kayal; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2020)

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

Randomized polynomial-time equivalence between determinant and trace-IMM equivalence tests. - Janaky Murthy; Vineet Nair; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2020)

Learning generalized depth-three arithmetic circuits in the non-degenerate case. - Vishwas Bhargava; Ankit Garg; Neeraj Kayal; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2021)

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)

Testing equivalence to design polynomials. - Omkar Baraskar; Agrim Dewan; Chandan Saha 001 (Electron. Colloquium Comput. Complex., 2024)

NP-hardness of testing equivalence to sparse polynomials and to constant-support polynomials. - Omkar Baraskar; Agrim Dewan; Chandan Saha 001; Pulkit Sinha (Electron. Colloquium Comput. Complex., 2024)