| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yoshinori Aono, Manindra Agrawal, Takakazu Sato, Osamu Watanabe |
On the Optimality of Lattices for the Coppersmith Technique.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, S. Barry Cooper, Angsheng Li (eds.) |
Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings |
TAMC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena |
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena |
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Angsheng Li |
Theory and applications of models of computation (TAMC 2008). |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena |
Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal |
The isomorphism conjecture for constant depth reductions. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal |
On the Arithmetic Complexity of Euler Function. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, S. Barry Cooper, Angsheng Li |
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009). |
Mathematical Structures in Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Osamu Watanabe |
One-Way Functions and the Isomorphism Conjecture. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Osamu Watanabe |
One-Way Functions and the Berman-Hartmanis Conjecture. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, V. Vinay |
Arithmetic Circuits: A Chasm at Depth Four. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Ding-Zhu Du, Zhenhua Duan, Angsheng Li (eds.) |
Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings |
TAMC |
2008 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf (eds.) |
Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007 |
Algebraic Methods in Computational Complexity |
2008 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, V. Vinay |
Arithmetic Circuits: A Chasm at Depth Four. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf |
The Polynomially Bounded Perfect Matching Problem Is in NC 2. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf |
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. |
Algebraic Methods in Computational Complexity |
2007 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf |
07411 Executive Summary -- Algebraic Methods in Computational Complexity. |
Algebraic Methods in Computational Complexity |
2007 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf |
The polynomially bounded perfect matching problem is in NC^2. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal |
Primality Tests Based on Fermat's Little Theorem. |
ICDCN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Nitin Saxena |
Equivalence of F-Algebras and Cubic Forms. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Frank Stephan, P. S. Thiagarajan, Shaofa Yang |
Behavioural Approximations for Restricted Linear Differential Hybrid Automata. |
HSCC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Nitin Saxena |
Automorphisms of Finite Rings and Applications to Complexity of Problems. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, P. S. Thiagarajan |
The Discrete Time Behavior of Lazy Linear Hybrid Automata. |
HSCC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal |
Proving Lower Bounds Via Pseudo-random Generators. |
FSTTCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, P. S. Thiagarajan |
Lazy Rectangular Hybrid Automata. |
HSCC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Primality and identity testing via Chinese remaindering. |
J. ACM |
2003 |
DBLP DOI BibTeX RDF |
Primality testing, polynomial identity testing |
| 1 | Manindra Agrawal |
On Derandomizing Tests for Certain Polynomial Identities. |
IEEE Conference on Computational Complexity |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal |
For completeness, sublogarithmic space is no space. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal |
Pseudo-Random Generators and Structure of Complete Degrees. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Completeness, Reductions, Pseudo-random Generators |
| 1 | Manindra Agrawal, Anil Seth (eds.) |
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings |
FSTTCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich |
Reducing the complexity of reductions. |
Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal |
Towards Uniform AC0 - Isomorphisms. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal |
The First-Order Isomorphism Theorem. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal |
Hard Sets and Pseudo-random Generators for Constant Depth Circuits. |
FSTTCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner |
Characterizing Small Depth and Small Space Classes by Operators of Higher Type. |
Chicago J. Theor. Comput. Sci. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta |
On TC0, AC0, and Arithmetic Circuits. |
J. Comput. Syst. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thomas Thierauf |
The Formula Isomorphism Problem. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Reducing Randomness via Chinese Remaindering |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Primality and Identity Testing via Chinese Remaindering. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
Primality testing, Polynomial identity testing |
| 1 | Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner |
Characterizing Small Depth and Small Space Classes by Operators of Higher Types |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Steven Rudich |
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. |
J. Comput. Syst. Sci. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thomas Thierauf |
The Satisfiability Problem for Probabilistic Ordered Branching Programs. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thomas Thierauf |
The Satisfiability Problem for Probabilistic Ordered Branching Programs |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta |
On TC0, AC0, and Arithmetic Circuits |
Electronic Colloquium on Computational Complexity (ECCC) |
1997 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal |
DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization. |
J. Comput. Syst. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender, Samir Datta |
On TC0, AC0, and Arithmetic Circuits. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
TC/sup 0/, AC/sup 0/, function classes, constant-depth polynomial-size arithmetic circuits, unbounded fanin addition, multiplication gates, constant-depth arithmetic circuits, computational complexity, normal forms, arithmetic circuits, closure properties |
| 1 | Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich |
Reducing the Complexity of Reductions. |
STOC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thomas Thierauf |
The Boolean Isomorphism Problem |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Eric Allender |
An Isomorphism Theorem for Circuit Complexity |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Richard Beigel, Thomas Thierauf |
Modulo Information from Nonadaptive Queries to NP |
Electronic Colloquium on Computational Complexity (ECCC) |
1996 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Vikraman Arvind |
Geometric Sets of Low Information Content. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Vikraman Arvind |
Quasi-Linear Truth-Table Reductions to p-Selective Sets. |
Theor. Comput. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Srinivasan Venkatesh |
On the Isomorphism Conjecture for 2-DFA Reductions. |
Int. J. Found. Comput. Sci. |
1996 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Vikraman Arvind |
A Note on Decision versus Search for Graph Automorphism. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
NP-Creative Sets: A New Class of Creative Sets in NP. |
Mathematical Systems Theory |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Polynomial-Time Isomorphism of 1-L-Complete Sets. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal |
On the Isomorphism Conjecture for Weak Reducibilities. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Thomas Thierauf |
The Boolean Isomorphism Problem. |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
Boolean isomorphism problem, one-round interactive proof, NP oracle, computational complexity, computational complexity, learning theory, Boolean formulas, polynomial hierarchy, equivalence queries |
| 1 | Manindra Agrawal, Eric Allender |
An Isomorphism Theorem for Circuit Complexity. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
Complete Sets, Berman-Hartmanis Conjecture, NC1, AC0, NC0, projections, Circuit Complexity, uniformity, Isomorphisms |
| 1 | Manindra Agrawal, Vikraman Arvind |
A Note on Decision versus Search for Graph Automorphism. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
Witness search, Graph Automorphisms |
| 1 | Manindra Agrawal, Richard Beigel, Thomas Thierauf |
Pinpointing Computation with Modular Queries in the Boolean Hierarchy. |
FSTTCS |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Manindra Agrawal, Vikraman Arvind |
Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal |
DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Vikraman Arvind |
Polynomial Time Truth-Table Reductions to P-Selective Sets. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal |
On the Isomorphism Problem for Weak Reducibilities. |
Structure in Complexity Theory Conference |
1994 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Polynomial Isomorphism of 1-L-Complete Sets. |
Structure in Complexity Theory Conference |
1993 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal, Somenath Biswas |
Universal Relations. |
Structure in Complexity Theory Conference |
1992 |
DBLP BibTeX RDF |
|
| 1 | Manindra Agrawal |
NP-hard Sets and Creativeness over Constant Time Languages. |
FSTTCS |
1991 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")