Homepage
Chandan Saha
Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1 4, Room 320
66123 Saarbrücken
Germany
Email:
Get my email address via email
Phone: +49 681 9325 1020
Fax: +49 681 9325 199
- Algebraic complexity Theory
- Randomized Algorithms
- Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
with Manindra Agrawal, Ramprasad Saptharishi and Nitin Saxena
Accepted to the 44th ACM Symposium on Theory of Computing (STOC), 2012.
- A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
with Ramprasad Saptharishi and Nitin Saxena .
Accepted to Computational Complexity.
- On the Sum of Square Roots of Polynomials and related problems
with Neeraj Kayal
26th IEEE Conference on Computational Complexity (CCC), 2011.
- Square root Bound on the Least Power Non-residue using the Sylvester-Vandermonde Determinant
with Michael Forbes, Neeraj Kayal and Rajat Mittal. arXiv 2011.
- The Power of Depth 2 Circuits over Algebras
with Ramprasad Saptharishi and Nitin Saxena
29th Foundation of Software Technology and Theoretical Computer Science (FSTTCS), 2009.
- Fast Integer Multiplication Using Modular Arithmetic,
with Anindya De, Piyush Kurur and Ramprasad Saptharishi
40th Annual ACM Symposium on Theory of Computing (STOC), 2008.
- Factoring Polynomials over Finite Fields using Balance Test
25th Annual Symposium on Theoretical Aspects of Computer Science (STACS), 2008.
- Covering a Set of Points in a
Plane using Two Parallel
Rectangles
with Sandip Das
Information Processing Letters (IPL), volume 109(16), 2009.
- Simpler algorithm for estimating frequency moments of data streams
with Lakshminath Bhuvanagiri, Sumit Ganguly and Deepanjan Kesh.
17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2006.
- Practical
Algorithms for Tracking Database Join Sizes
with Sumit Ganguly and Deepanjan Kesh.
25th Foundation of Software Technology and Theoretical Computer Science (FSTTCS), 2005.
