Manindra Agrawal

According to our database1, Manindra Agrawal authored at least 97 papers between 1991 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
The query complexity of a permutation-based variant of Mastermind.
Discrete Applied Mathematics, 2019

2018
Bootstrapping variables in algebraic circuits.
Electronic Colloquium on Computational Complexity (ECCC), 2018

The Query Complexity of a Permutation-Based Variant of Mastermind.
CoRR, 2018

On the optimality of lattices for the coppersmith technique.
Appl. Algebra Eng. Commun. Comput., 2018

Bootstrapping variables in algebraic circuits.
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017
Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good.
Electronic Colloquium on Computational Complexity (ECCC), 2017

Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good.
CoRR, 2017

Dimension, pseudorandomness and extraction of pseudorandomness.
Computability, 2017

2016
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits.
SIAM J. Comput., 2016

Integer Factoring Using Small Algebraic Dependencies.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits.
SIAM J. Comput., 2015

Approximate Verification of the Symbolic Dynamics of Markov Chains.
J. ACM, 2015

Dimension, Pseudorandomness and Extraction of Pseudorandomness.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
Theory and Applications of Models of Computation at the Turing Centenary in China.
Theor. Comput. Sci., 2014

Hitting-sets for ROABP and Sum of Set-Multilinear circuits.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Algebra in Computational Complexity (Dagstuhl Seminar 14391).
Dagstuhl Reports, 2014

Hitting-sets for ROABP and Sum of Set-Multilinear circuits.
CoRR, 2014

A Roadmap for TAMC.
Proceedings of the Theory and Applications of Models of Computation, 2014

2013
Hitting-sets for low-distance multilinear depth-3.
Electronic Colloquium on Computational Complexity (ECCC), 2013

Hitting-sets for low-distance multilinear depth-3.
CoRR, 2013

Quasi-polynomial hitting-set for set-depth-Δ formulas.
Proceedings of the Symposium on Theory of Computing Conference, 2013

The Query Complexity of Finding a Hidden Permutation.
Proceedings of the Space-Efficient Data Structures, 2013

2012
On the Optimality of Lattices for the Coppersmith Technique.
IACR Cryptology ePrint Archive, 2012

Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas.
Electronic Colloquium on Computational Complexity (ECCC), 2012

The Deterministic and Randomized Query Complexity of a Simple Guessing Game.
Electronic Colloquium on Computational Complexity (ECCC), 2012

Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421).
Dagstuhl Reports, 2012

Quasi-polynomial Hitting-set for Set-depth-Delta Formulas
CoRR, 2012

Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits.
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012

Approximate Verification of the Symbolic Dynamics of Markov Chains.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

On the Optimality of Lattices for the Coppersmith Technique.
Proceedings of the Information Security and Privacy - 17th Australasian Conference, 2012

The Discrete Time Behaviour of Restricted Linear Hybrid Automata.
Proceedings of the Modern Applications of Automata Theory., 2012

2011
Theory and applications of models of computation (TAMC 2008).
Theor. Comput. Sci., 2011

The isomorphism conjecture for constant depth reductions.
J. Comput. Syst. Sci., 2011

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

Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits
CoRR, 2011

On the Arithmetic Complexity of Euler Function.
Proceedings of the Computer Science - Theory and Applications, 2011

2010
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009).
Mathematical Structures in Computer Science, 2010

2009
One-Way Functions and the Isomorphism Conjecture.
Electronic Colloquium on Computational Complexity (ECCC), 2009

09421 Executive Summary - Algebraic Methods in Computational Complexity.
Proceedings of the Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009, 2009

09421 Abstracts Collection - Algebraic Methods in Computational Complexity.
Proceedings of the Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009, 2009

One-Way Functions and the Berman-Hartmanis Conjecture.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008
Arithmetic Circuits: A Chasm at Depth Four.
Electronic Colloquium on Computational Complexity (ECCC), 2008

Arithmetic Circuits: A Chasm at Depth Four.
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008

2007
The Polynomially Bounded Perfect Matching Problem Is in NC 2.
Proceedings of the STACS 2007, 2007

07411 Abstracts Collection -- Algebraic Methods in Computational Complexity.
Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007

07411 Executive Summary -- Algebraic Methods in Computational Complexity.
Proceedings of the Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007, 2007

2006
The polynomially bounded perfect matching problem is in NC^2.
Electronic Colloquium on Computational Complexity (ECCC), 2006

Equivalence of F-Algebras and Cubic Forms.
Proceedings of the STACS 2006, 2006

Primality Tests Based on Fermat's Little Theorem.
Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

Behavioural Approximations for Restricted Linear Differential Hybrid Automata.
Proceedings of the Hybrid Systems: Computation and Control, 9th International Workshop, 2006

2005
Automorphisms of Finite Rings and Applications to Complexity of Problems.
Proceedings of the STACS 2005, 2005

The Discrete Time Behavior of Lazy Linear Hybrid Automata.
Proceedings of the Hybrid Systems: Computation and Control, 8th International Workshop, 2005

Proving Lower Bounds Via Pseudo-random Generators.
Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004
Lazy Rectangular Hybrid Automata.
Proceedings of the Hybrid Systems: Computation and Control, 7th International Workshop, 2004

2003
Primality and identity testing via Chinese remaindering.
J. ACM, 2003

On Derandomizing Tests for Certain Polynomial Identities.
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003

2002
For completeness, sublogarithmic space is no space.
Inf. Process. Lett., 2002

Pseudo-Random Generators and Structure of Complete Degrees.
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002

2001
Reducing the complexity of reductions.
Computational Complexity, 2001

The First-Order Isomorphism Theorem.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Hard Sets and Pseudo-random Generators for Constant Depth Circuits.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Towards Uniform AC0 - Isomorphisms.
Proceedings of the 16th Annual IEEE Conference on Computational Complexity, 2001

2000
The Formula Isomorphism Problem.
SIAM J. Comput., 2000

On TC0, AC0, and Arithmetic Circuits.
J. Comput. Syst. Sci., 2000

Characterizing Small Depth and Small Space Classes by Operators of Higher Type.
Chicago J. Theor. Comput. Sci., 2000

1999
Reducing Randomness via Chinese Remaindering
Electronic Colloquium on Computational Complexity (ECCC), 1999

Primality and Identity Testing via Chinese Remaindering.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem.
J. Comput. Syst. Sci., 1998

Characterizing Small Depth and Small Space Classes by Operators of Higher Types
Electronic Colloquium on Computational Complexity (ECCC), 1998

The Satisfiability Problem for Probabilistic Ordered Branching Programs.
Proceedings of the 13th Annual IEEE Conference on Computational Complexity, 1998

1997
DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization.
J. Comput. Syst. Sci., 1997

The Satisfiability Problem for Probabilistic Ordered Branching Programs
Electronic Colloquium on Computational Complexity (ECCC), 1997

On TC0, AC0, and Arithmetic Circuits
Electronic Colloquium on Computational Complexity (ECCC), 1997

Reducing the Complexity of Reductions.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

On TC0, AC0, and Arithmetic Circuits.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997

1996
Quasi-Linear Truth-Table Reductions to p-Selective Sets.
Theor. Comput. Sci., 1996

Geometric Sets of Low Information Content.
Theor. Comput. Sci., 1996

NP-Creative Sets: A New Class of Creative Sets in NP.
Mathematical Systems Theory, 1996

Polynomial-Time Isomorphism of 1-L-Complete Sets.
J. Comput. Syst. Sci., 1996

On the Isomorphism Conjecture for Weak Reducibilities.
J. Comput. Syst. Sci., 1996

On the Isomorphism Conjecture for 2-DFA Reductions.
Int. J. Found. Comput. Sci., 1996

A Note on Decision versus Search for Graph Automorphism.
Inf. Comput., 1996

The Boolean Isomorphism Problem
Electronic Colloquium on Computational Complexity (ECCC), 1996

An Isomorphism Theorem for Circuit Complexity
Electronic Colloquium on Computational Complexity (ECCC), 1996

Modulo Information from Nonadaptive Queries to NP
Electronic Colloquium on Computational Complexity (ECCC), 1996

Pinpointing Computation with Modular Queries in the Boolean Hierarchy.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996

The Boolean Isomorphism Problem.
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

A Note on Decision versus Search for Graph Automorphism.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

An Isomorphism Theorem for Circuit Complexity.
Proceedings of the Eleveth Annual IEEE Conference on Computational Complexity, 1996

1995
Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets.
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization.
Proceedings of the Tenth Annual Structure in Complexity Theory Conference, 1995

1994
Polynomial Time Truth-Table Reductions to P-Selective Sets.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

On the Isomorphism Problem for Weak Reducibilities.
Proceedings of the Ninth Annual Structure in Complexity Theory Conference, Amsterdam, The Netherlands, June 28, 1994

1993
Polynomial Isomorphism of 1-L-Complete Sets.
Proceedings of the Eigth Annual Structure in Complexity Theory Conference, 1993

1992
Universal Relations.
Proceedings of the Seventh Annual Structure in Complexity Theory Conference, 1992

1991
NP-hard Sets and Creativeness over Constant Time Languages.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991


  Loading...