Your search returned the following 5 documents:

5. A Case of Depth-3 Identity Testing, Sparse Factorization and Duality
   Manindra Agrawal, Chandan Saha, and Nitin Saxena
   In: 45th ACM Symposium on the Theory of Computing (STOC-13), Palo Alto, USA, 2013
   
4. The Query Complexity of Finding a Hidden Permutation
   Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, and Kurt Mehlhorn
   In: Space-Efficient Data Structures, Streams, and Algorithms, 2013, 1-11
   
3. Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
   Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, and Nitin Saxena
   In: STOC'12 : Proceedings of the 2012 ACM Symposium on Theory of Computing, New York, NY, 2012, 599-614
   
   
2. Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
   Manindra Agrawal, Chandan Saha, and Nitin Saxena
   arXiv abs/1209.2333: 1-13, 2012
   
   
1. The Query Complexity of Finding a Hidden Permutation
   Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Kasper Green Larsen, Kurt Mehlhorn, and Carola Winzen
   Electronic Colloquium on Computational Complexity (ECCC): Report Series 87 (Revision 1): 1-36, 2012