Why Is Manindra Agrawal Influential?
According to Wikipedia , Manindra Agrawal is a professor at the Department of Computer Science and Engineering and the Deputy Director at the Indian Institute of Technology, Kanpur. He was also the recipient of the first Infosys Prize for Mathematics, the Godel Prize in 2006; and the Shanti Swarup Bhatnagar Award in Mathematical Sciences in 2003. He has been honoured with Padma Shri in 2013.
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
2000 2010 2020 0 125 250 375 500 625 750 875 1000 1125 Published Papers PRIMES is in P Arithmetic Circuits: A Chasm at Depth Four Proving Lower Bounds Via Pseudo-random Generators Primality and identity testing via Chinese remaindering On TC0, AC0, and Arithmetic Circuits Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science Quasi-polynomial hitting-set for set-depth-Δ formulas Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem Primality and identity testing via Chinese remaindering The Formula Isomorphism Problem Polynomial time truth-table reductions to p-selective sets The Boolean isomorphism problem Reducing the complexity of reductions Quasi-Linear Truth-Table Reductions to p-Selective Sets Equivalence of F-Algebras and Cubic Forms Pseudo-random generators and structure of complete degrees The Query Complexity of Finding a Hidden Permutation The Discrete Time Behavior of Lazy Linear Hybrid Automata Approximate Verification of the Symbolic Dynamics of Markov Chains The Polynomially Bounded Perfect Matching Problem Is in NC 2 Automorphisms of Finite Rings and Applications to Complexity of Problems Lazy Rectangular Hybrid Automata Reducing the complexity of reductions Universal relations Bootstrapping variables in algebraic circuits Determinant versus permanent Modelling the spread of SARS-CoV-2 pandemic - Impact of lockdowns & interventions Polynomial isomorphism of 1-L-complete sets Classifying polynomials and identity testing (15) On the isomorphism problem for weak reducibilities Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits On derandomizing tests for certain polynomial identities Geometric Sets of Low Information Content Behavioural Approximations for Restricted Linear Differential Hybrid Automata Hard Sets and Pseudo-random Generators for Constant Depth Circuits Approximate Verification of the Symbolic Dynamics of Markov Chains The Query Complexity of a Permutation-Based Variant of Mastermind An isomorphism theorem for circuit complexity Quasi-polynomial Hitting-set for Set-depth-Delta Formulas (11) The isomorphism conjecture for constant depth reductions Primality Tests Based on Fermat's Little Theorem One-Way Functions and the Berman-Hartmanis Conjecture SUTRA: An Approach to Modelling Pandemics with Asymptomatic Patients,and Applications to COVID-19 (10) The First-Order Isomorphism Theorem On TC/sup 0/, AC/sup 0/, and arithmetic circuits Modulo Information from Nonadaptive Queries to NP (9) A Note on Decision versus Search for Graph Automorphism One-Way Functions and the Isomorphism Conjecture (8) Proceedings of the 5th international conference on Theory and applications of models of computation (7) Towards Uniform AC0 -Isomorphisms (7) PRIMES is in (7) On the Isomorphism Conjecture for Weak Reducibilities The satisfiability problem for probabilistic ordered branching programs DSPACE(n)=?NSPACE(n): a degree theoretic characterization Characterizing Small Depth and Small Space Classes by Operators of Higher Type (5) On the optimality of lattices for the coppersmith technique On the Arithmetic Complexity of Euler Function The Isomorphism Conjecture for NP Polynomial-Time Isomorphism of 1-L-Complete Sets Cryptography: A Survey Perspectives in Computational Complexity: The Somenath Biswas Anniversary Volume (3) For completeness, sublogarithmic space is no space Hitting-sets for low-distance multilinear depth-3 (3) Bootstrapping variables in algebraic circuits Pinpointing Computation with Modular Queries in the Boolean Hierarchy On the Optimality of Lattices for the Coppersmith Technique Reductions of self-reducible sets to depth-1 weighted threshold circuit classes, and sparse sets Perspectives in Computational Complexity On the Isomorphism Conjecture for 2-DFA Reductions Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good (2) Integer Factoring Using Small Algebraic Dependencies Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science (1) Towards uniform AC/sup 0/-isomorphisms A Roadmap for TAMC Dimension, Pseudorandomness and Extraction of Pseudorandomness Theory and applications of models of computation (TAMC 2008) NP-Creative sets: A new class of creative sets in NP Impossibility of Derandomizing the Isolation Lemma for all Families (1) The Deterministic and Randomized Query Complexity of a Simple Guessing Game (1) DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization Decision letter: Insights from a Pan India Sero-Epidemiological survey (Phenome-India Cohort) for SARS-CoV2 Pseudo-random generator for Switching Lemma (0) Algebra in Computational Complexity (Dagstuhl Seminar 14391) A brief history of polynomial identity testing Algebraic Methods in Computational Complexity Dagstuhl Seminar (0) Two Randomized Algorithms for Primality Testing (0) Reducing Randomness via Chinese Remaindering (0) Satis ability Problems (0) The Discrete Time Behaviour of Restricted Linear Hybrid Automata Executive Summary of Dagstuhl Seminar 09421 on Algebraic Methods in Computational Complexity October 11 to 16 , 2009 organized by Manindra Agrawal (0) 09421 Abstracts Collection - Algebraic Methods in Computational Complexity (0) Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008–2009) A note on decision versus search for graph automorphism Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421) SUTRA: A Novel Approach to Modelling Pandemics with Applications to COVID-19 (0) Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation (0) On the Isomorphism Problem for Weak Reducibilities (Extended Abstract) (0) On the Complexity of Certain Algebraic and Number Theoretic Problems (0) Analysis of Pseudorandom Permutations (0) Theory and Applications of Models of Computation at the Turing Centenary in China Authors' response. Small hitting-sets for tiny algebraic circuits or : How to turn bad designs into good (0) Theory and A pplications of M odels of Computation (0) ON THE COMPLEXITY OF CUBIC FORMS (0) Theory and applications of models of computation : 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012 : proceedings (0) Computational Complexity RandomWalks on Expanders (0) Lecture 1 & 2: Integer and Modular Arithmetic 1.1 Integer Addition and Subtraction 1.2 Integer Multiplication (0) Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007 (0) Math 788M: Computational Number Theory (0) 09421 Executive Summary - Algebraic Methods in Computational Complexity (0) SUTRA: An Approach to Modelling Pandemics with Undetected (Asymptomatic) Patients, and Applications to COVID-19 78 12421 – Algebraic and Combinatorial Methods in Computational Complexity Participants (0) Acknowledgement 86 14391 – Algebra in Computational Complexity 1 Executive Summary (0) Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness (0) 18.703 Modern Algebra, A Quick Primality Test (0) Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings SUTRA: A Novel Approach to Modelling Pandemics with Asymptomatic and Undetected Patients, and Applications to COVID-19 (0) How Far Are We from Proving Circuit Size Lower Bounds ? (0) DS-1-7 On Coppersmith's Technique and its Limit (0) NP-hard Sets and Creativeness over Constant Time Languages Dimension, pseudorandomness and extraction of pseudorandomness Authors' response On Equivalence of Nondeterministic and Unambiguous Logarithmic Space Bounded Turing Machines (0) More Papers This paper list is powered by the following services:
Other Resources About Manindra Agrawal What Schools Are Affiliated With Manindra Agrawal? Manindra Agrawal is affiliated with the following schools:
Manindra Agrawal's AcademicInfluence.com Rankings
