Manindra Agrawal

Manindra Agrawal's AcademicInfluence.com Rankings

Manindra Agrawal

Computer Science

#12060

World Rank

#12845

Historical Rank

Database

#9128

World Rank

#9599

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Manindra Agrawal Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Manindra Agrawal's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

PRIMES is in P (2004) (1057)
Arithmetic Circuits: A Chasm at Depth Four (2008) (221)
Proving Lower Bounds Via Pseudo-random Generators (2005) (145)
Primality and identity testing via Chinese remaindering (1999) (142)
Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits (2011) (69)
On TC0, AC0, and Arithmetic Circuits (2000) (63)
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (2014) (56)
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science (2002) (55)
Reducing the complexity of reductions (1997) (53)
Quasi-polynomial hitting-set for set-depth-Δ formulas (2012) (50)
Approximate Verification of the Symbolic Dynamics of Markov Chains (2012) (43)
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem (1998) (43)
The Formula Isomorphism Problem (2000) (37)
The Boolean isomorphism problem (1996) (34)
Quasi-Linear Truth-Table Reductions to p-Selective Sets (1996) (31)
The Query Complexity of Finding a Hidden Permutation (2013) (31)
Equivalence of F-Algebras and Cubic Forms (2006) (31)
Polynomial time truth-table reductions to p-selective sets (1994) (31)
Automorphisms of Finite Rings and Applications to Complexity of Problems (2005) (29)
The Discrete Time Behavior of Lazy Linear Hybrid Automata (2005) (28)
Bootstrapping variables in algebraic circuits (2018) (27)
Pseudo-random generators and structure of complete degrees (2002) (25)
The Polynomially Bounded Perfect Matching Problem Is in NC 2 (2007) (25)
Modelling the spread of SARS-CoV-2 pandemic - Impact of lockdowns & interventions (2020) (22)
Lazy Rectangular Hybrid Automata (2004) (19)
Classifying polynomials and identity testing (2009) (16)
Universal relations (1992) (16)
SUTRA: An Approach to Modelling Pandemics with Asymptomatic Patients,and Applications to COVID-19 (2021) (16)
The Query Complexity of a Permutation-Based Variant of Mastermind (2018) (14)
Polynomial isomorphism of 1-L-complete sets (1993) (14)
Proceedings of the 5th international conference on Theory and applications of models of computation (2006) (14)
On derandomizing tests for certain polynomial identities (2003) (13)
On the isomorphism problem for weak reducibilities (1994) (13)
Determinant versus permanent (2006) (13)
Behavioural Approximations for Restricted Linear Differential Hybrid Automata (2006) (13)
Geometric Sets of Low Information Content (1996) (12)
Quasi-polynomial Hitting-set for Set-depth-Delta Formulas (2012) (11)
Hard Sets and Pseudo-random Generators for Constant Depth Circuits (2001) (11)
An isomorphism theorem for circuit complexity (1996) (10)
The isomorphism conjecture for constant depth reductions (2011) (10)
A note on decision versus search for graph automorphism (1996) (10)
One-Way Functions and the Berman-Hartmanis Conjecture (2009) (10)
Approximate Verification of the Symbolic Dynamics of Markov Chains (2015) (10)
Primality Tests Based on Fermat's Little Theorem (2006) (10)
On TC/sup 0/, AC/sup 0/, and arithmetic circuits (1997) (9)
SUTRA: A Novel Approach to Modelling Pandemics with Applications to COVID-19 (2021) (8)
PRIMES is in (2002) (8)
The Satisfiability Problem for Probabilistic Ordered Branching Programs (1998) (8)
Modulo Information from Nonadaptive Queries to NP (1996) (7)
Towards Uniform AC0 -Isomorphisms (2001) (7)
One-Way Functions and the Isomorphism Conjecture (2009) (7)
On the optimality of lattices for the coppersmith technique (2012) (6)
On the Isomorphism Conjecture for Weak Reducibilities (1996) (6)
Errata: PRIMES is in P (2019) (5)
DSPACE(n)=?NSPACE(n): a degree theoretic characterization (1995) (5)
Hitting-sets for low-distance multilinear depth-3 (2013) (4)
The Isomorphism Conjecture for NP (2011) (4)
Polynomial-Time Isomorphism of 1-L-Complete Sets (1996) (4)
Pinpointing Computation with Modular Queries in the Boolean Hierarchy (1996) (4)
On the Arithmetic Complexity of Euler Function (2011) (4)
Characterizing Small Depth and Small Space Classes by Operators of Higher Type (2000) (4)
Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good (2017) (4)
The First-Order Isomorphism Theorem (2001) (4)
Cryptography: A Survey (1999) (3)
For completeness, sublogarithmic space is no space (2002) (3)
Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets (1995) (3)
Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume (2014) (3)
Perspectives in Computational Complexity (2014) (2)
Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings (2008) (2)
Integer Factoring Using Small Algebraic Dependencies (2016) (2)
On the Isomorphism Conjecture for 2-DFA Reductions (1996) (2)
On the optimality of lattices for the coppersmith technique (2017) (1)
NP-Creative sets: A new class of creative sets in NP (1996) (1)
The Deterministic and Randomized Query Complexity of a Simple Guessing Game (2012) (1)
SUTRA: A Novel Approach to Modelling Pandemics with Asymptomatic and Undetected Patients, and Applications to COVID-19 (2021) (1)
Theory and applications of models of computation (TAMC 2008) (2011) (1)
PROVING PRIMALITY AFTER AGRAWAL-KAYAL-SAXENA (2022) (1)
Impossibility of Derandomizing the Isolation Lemma for all Families (2020) (1)
Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science (2002) (1)
A Roadmap for TAMC (2014) (1)
SUTRA: An Approach to Modelling Pandemics with Undetected (Asymptomatic) Patients, and Applications to COVID-19 (2021) (1)
Towards uniform AC/sup 0/-isomorphisms (2001) (1)
Two Randomized Algorithms for Primality Testing (2005) (0)
Executive Summary of Dagstuhl Seminar 09421 on Algebraic Methods in Computational Complexity October 11 to 16 , 2009 organized by Manindra Agrawal (2009) (0)
Pseudo-random generator for Switching Lemma (0)
Theory and applications of models of computation : 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012 : proceedings (2012) (0)
Algebraic Methods in Computational Complexity Dagstuhl Seminar (2010) (0)
78 12421 – Algebraic and Combinatorial Methods in Computational Complexity Participants (2013) (0)
Reducing Randomness via Chinese Remaindering (1999) (0)
Dimension, Pseudorandomness and Extraction of Pseudorandomness (2015) (0)
09421 Executive Summary - Algebraic Methods in Computational Complexity (2009) (0)
On the Isomorphism Problem for Weak Reducibilities (Extended Abstract) (1994) (0)
86 14391 – Algebra in Computational Complexity 1 Executive Summary (2015) (0)
DS-1-7 On Coppersmith's Technique and its Limit (2010) (0)
Satis ability Problems (2007) (0)
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421) (2012) (0)
Algebra in Computational Complexity (Dagstuhl Seminar 14391) (2014) (0)
Analysis of Pseudorandom Permutations (2002) (0)
NP-hard Sets and Creativeness over Constant Time Languages (1991) (0)
ON THE COMPLEXITY OF CUBIC FORMS (2007) (0)
Math 788M: Computational Number Theory (2007) (0)
Theory and A pplications of M odels of Computation (2014) (0)
On the Complexity of Certain Algebraic and Number Theoretic Problems (2010) (0)
Authors' response (2021) (0)
How Far Are We from Proving Circuit Size Lower Bounds ? (2008) (0)
18.703 Modern Algebra, A Quick Primality Test (2013) (0)
Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation (2012) (0)
The Discrete Time Behaviour of Restricted Linear Hybrid Automata (2012) (0)
Lecture 1 & 2: Integer and Modular Arithmetic 1.1 Integer Addition and Subtraction 1.2 Integer Multiplication (2009) (0)
09421 Abstracts Collection - Algebraic Methods in Computational Complexity (2009) (0)
A brief history of polynomial identity testing (2014) (0)
Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007 (2008) (0)
Small hitting-sets for tiny algebraic circuits or : How to turn bad designs into good (2017) (0)
Computational Complexity RandomWalks on Expanders (2007) (0)
Theory and Applications of Models of Computation at the Turing Centenary in China (2014) (0)
Authors' response. (2021) (0)
A Characterization of NCk by First Order Functional Programs (2018) (0)
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008–2009) (2010) (0)
SUTRA: An Approach to Modelling Pandemics with Undetected Patients, and Applications to COVID-19 (2022) (0)
Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness (2014) (0)

This paper list is powered by the following services:

Manindra Agrawal's Academic­Influence.com Rankings

Why Is Manindra Agrawal Influential?

Manindra Agrawal's Published Works

Published Works

Manindra Agrawal's AcademicInfluence.com Rankings