Manindra Agrawal

Publication Activity (10 Years)

Years Active: 1991-2021
Publications (10 Years): 12

Top Topics

Inversely Proportional

Top Venues

Electron. Colloquium Comput. Complex.

Dagstuhl Reports

Publications

Manindra Agrawal, Madhuri Kanitkar, Mathukumalli Vidyasagar
SUTRA: An Approach to Modelling Pandemics with Undetected (Asymptomatic) Patients, and Applications to COVID-19. CDC (2021)
Manindra Agrawal, Rohit Gurjar, Thomas Thierauf
Impossibility of Derandomizing the Isolation Lemma for all Families. Electron. Colloquium Comput. Complex. 27 (2020)
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
The query complexity of a permutation-based variant of Mastermind. Discret. Appl. Math. 260 (2019)
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
The Query Complexity of a Permutation-Based Variant of Mastermind. CoRR (2018)
Manindra Agrawal, Sumanta Ghosh, Nitin Saxena
Bootstrapping variables in algebraic circuits. STOC (2018)
Manindra Agrawal, Sumanta Ghosh, Nitin Saxena
Bootstrapping variables in algebraic circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Yoshinori Aono, Manindra Agrawal, Takakazu Satoh, Osamu Watanabe
On the optimality of lattices for the coppersmith technique. Appl. Algebra Eng. Commun. Comput. 29 (2) (2018)
Manindra Agrawal, Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good. Electron. Colloquium Comput. Complex. 24 (2017)
Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar
Dimension, pseudorandomness and extraction of pseudorandomness. Comput. 6 (3) (2017)
Manindra Agrawal, Michael A. Forbes, Sumanta Ghosh, Nitin Saxena
Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good. CoRR (2017)
Manindra Agrawal, Nitin Saxena, Shubham Sahai Srivastava
Integer Factoring Using Small Algebraic Dependencies. MFCS (2016)
Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. SIAM J. Comput. 45 (4) (2016)
Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar
Dimension, Pseudorandomness and Extraction of Pseudorandomness. FSTTCS (2015)
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM J. Comput. 44 (3) (2015)
Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan
Approximate Verification of the Symbolic Dynamics of Markov Chains. J. ACM 62 (1) (2015)
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-sets for ROABP and Sum of Set-Multilinear circuits. CoRR (2014)
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-sets for ROABP and Sum of Set-Multilinear circuits. Electron. Colloquium Comput. Complex. 21 (2014)
Manindra Agrawal, Valentine Kabanets, Thomas Thierauf, Christopher Umans
Algebra in Computational Complexity (Dagstuhl Seminar 14391). Dagstuhl Reports 4 (9) (2014)
T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper
A Roadmap for TAMC. TAMC (2014)
Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar
Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness. Electron. Colloquium Comput. Complex. 21 (2014)
George Barmpalias, Manindra Agrawal, S. Barry Cooper
Theory and Applications of Models of Computation at the Turing Centenary in China. Theor. Comput. Sci. 560 (2014)
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-sets for low-distance multilinear depth-3. CoRR (2013)
Manindra Agrawal, Chandan Saha, Nitin Saxena
Quasi-polynomial hitting-set for set-depth-Δ formulas. STOC (2013)
Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena
Hitting-sets for low-distance multilinear depth-3. Electron. Colloquium Comput. Complex. 20 (2013)
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn
The Query Complexity of Finding a Hidden Permutation. Space-Efficient Data Structures, Streams, and Algorithms (2013)
Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn
The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electron. Colloquium Comput. Complex. 19 (2012)
Manindra Agrawal, Chandan Saha, Nitin Saxena
Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas. Electron. Colloquium Comput. Complex. 19 (2012)
Yoshinori Aono, Manindra Agrawal, Takakazu Satoh, Osamu Watanabe
On the Optimality of Lattices for the Coppersmith Technique. ACISP (2012)
Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan
Approximate Verification of the Symbolic Dynamics of Markov Chains. LICS (2012)
Manindra Agrawal, Thomas Thierauf, Christopher Umans
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421). Dagstuhl Reports 2 (10) (2012)
Yoshinori Aono, Manindra Agrawal, Takakazu Satoh, Osamu Watanabe
On the Optimality of Lattices for the Coppersmith Technique. IACR Cryptol. ePrint Arch. 2012 (2012)
Manindra Agrawal, Chandan Saha, Nitin Saxena
Quasi-polynomial Hitting-set for Set-depth-Delta Formulas CoRR (2012)
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)
Manindra Agrawal, Angsheng Li
Theory and applications of models of computation (TAMC 2008). Theor. Comput. Sci. 412 (18) (2011)
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. Electron. Colloquium Comput. Complex. 18 (2011)
Manindra Agrawal
On the Arithmetic Complexity of Euler Function. CSR (2011)
Manindra Agrawal
The isomorphism conjecture for constant depth reductions. J. Comput. Syst. Sci. 77 (1) (2011)
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)
Manindra Agrawal, S. Barry Cooper, Angsheng Li
Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009). Math. Struct. Comput. Sci. 20 (5) (2010)
Manindra Agrawal, Osamu Watanabe
One-Way Functions and the Isomorphism Conjecture. Electron. Colloquium Comput. Complex. 16 (2009)
Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans
09421 Abstracts Collection - Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity (2009)
Manindra Agrawal, Osamu Watanabe
One-Way Functions and the Berman-Hartmanis Conjecture. Computational Complexity Conference (2009)
Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans
09421 Executive Summary - Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity (2009)
Manindra Agrawal, V. Vinay
Arithmetic Circuits: A Chasm at Depth Four. Electron. Colloquium Comput. Complex. 15 (062) (2008)
Manindra Agrawal, V. Vinay
Arithmetic Circuits: A Chasm at Depth Four. FOCS (2008)
Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity (2007)
Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf
07411 Executive Summary -- Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity (2007)
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf
. STACS (2007)
Manindra Agrawal
Primality Tests Based on Fermat's Little Theorem. ICDCN (2006)
Manindra Agrawal, Nitin Saxena
Equivalence of F-Algebras and Cubic Forms. STACS (2006)
Manindra Agrawal, Frank Stephan, P. S. Thiagarajan, Shaofa Yang
Behavioural Approximations for Restricted Linear Differential Hybrid Automata. HSCC (2006)
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf
The polynomially bounded perfect matching problem is in NC^2. Electron. Colloquium Comput. Complex. 13 (129) (2006)
Manindra Agrawal
Proving Lower Bounds Via Pseudo-random Generators. FSTTCS (2005)
Manindra Agrawal, Nitin Saxena
Automorphisms of Finite Rings and Applications to Complexity of Problems. STACS (2005)
Manindra Agrawal, P. S. Thiagarajan
The Discrete Time Behavior of Lazy Linear Hybrid Automata. HSCC (2005)
Manindra Agrawal, P. S. Thiagarajan
Lazy Rectangular Hybrid Automata. HSCC (2004)
Manindra Agrawal
On Derandomizing Tests for Certain Polynomial Identities. Computational Complexity Conference (2003)
Manindra Agrawal, Somenath Biswas
Primality and identity testing via Chinese remaindering. J. ACM 50 (4) (2003)
Manindra Agrawal
Pseudo-Random Generators and Structure of Complete Degrees. Computational Complexity Conference (2002)
Manindra Agrawal
For completeness, sublogarithmic space is no space. Inf. Process. Lett. 82 (6) (2002)
Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
Reducing the complexity of reductions. Comput. Complex. 10 (2) (2001)
Manindra Agrawal
- Isomorphisms. Computational Complexity Conference (2001)
Manindra Agrawal
Hard Sets and Pseudo-random Generators for Constant Depth Circuits. FSTTCS (2001)
Manindra Agrawal
The First-Order Isomorphism Theorem. FSTTCS (2001)
Manindra Agrawal, Thomas Thierauf
The Formula Isomorphism Problem. SIAM J. Comput. 30 (3) (2000)
Manindra Agrawal, Eric Allender, Samir Datta
, and Arithmetic Circuits. J. Comput. Syst. Sci. 60 (2) (2000)
Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner
Characterizing Small Depth and Small Space Classes by Operators of Higher Type. Chic. J. Theor. Comput. Sci. 2000 (2000)
Manindra Agrawal, Somenath Biswas
Reducing Randomness via Chinese Remaindering Electron. Colloquium Comput. Complex. 6 (18) (1999)
Manindra Agrawal, Somenath Biswas
Primality and Identity Testing via Chinese Remaindering. FOCS (1999)
Manindra Agrawal, Thomas Thierauf
The Satisfiability Problem for Probabilistic Ordered Branching Programs. Computational Complexity Conference (1998)
Manindra Agrawal, Eric Allender, Steven Rudich
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. J. Comput. Syst. Sci. 57 (2) (1998)
Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner
Characterizing Small Depth and Small Space Classes by Operators of Higher Types Electron. Colloquium Comput. Complex. 5 (57) (1998)
Manindra Agrawal
DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization. J. Comput. Syst. Sci. 54 (3) (1997)
Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich
Reducing the Complexity of Reductions. STOC (1997)
Manindra Agrawal, Eric Allender, Samir Datta
, and Arithmetic Circuits. Computational Complexity Conference (1997)
Manindra Agrawal, Thomas Thierauf
The Satisfiability Problem for Probabilistic Ordered Branching Programs Electron. Colloquium Comput. Complex. 4 (60) (1997)
Manindra Agrawal, Eric Allender, Samir Datta
, and Arithmetic Circuits Electron. Colloquium Comput. Complex. 4 (16) (1997)
Manindra Agrawal, Somenath Biswas
Polynomial-Time Isomorphism of 1-L-Complete Sets. J. Comput. Syst. Sci. 53 (2) (1996)
Manindra Agrawal
On the Isomorphism Conjecture for Weak Reducibilities. J. Comput. Syst. Sci. 53 (2) (1996)
Manindra Agrawal, Somenath Biswas
NP-Creative Sets: A New Class of Creative Sets in NP. Math. Syst. Theory 29 (5) (1996)
Manindra Agrawal, Richard Beigel, Thomas Thierauf
Modulo Information from Nonadaptive Queries to NP Electron. Colloquium Comput. Complex. 3 (1) (1996)
Manindra Agrawal, Thomas Thierauf
The Boolean Isomorphism Problem Electron. Colloquium Comput. Complex. 3 (32) (1996)
Manindra Agrawal, Vikraman Arvind
Geometric Sets of Low Information Content. Theor. Comput. Sci. 158 (1&2) (1996)
Manindra Agrawal, Vikraman Arvind
A Note on Decision versus Search for Graph Automorphism. Computational Complexity Conference (1996)
Manindra Agrawal, Vikraman Arvind
Quasi-Linear Truth-Table Reductions to p-Selective Sets. Theor. Comput. Sci. 158 (1&2) (1996)
Manindra Agrawal, Vikraman Arvind
A Note on Decision versus Search for Graph Automorphism. Inf. Comput. 131 (2) (1996)
Manindra Agrawal, Eric Allender
An Isomorphism Theorem for Circuit Complexity Electron. Colloquium Comput. Complex. 3 (2) (1996)
Manindra Agrawal, Eric Allender
An Isomorphism Theorem for Circuit Complexity. Computational Complexity Conference (1996)
Manindra Agrawal, Richard Beigel, Thomas Thierauf
Pinpointing Computation with Modular Queries in the Boolean Hierarchy. FSTTCS (1996)
Manindra Agrawal, Srinivasan Venkatesh
On the Isomorphism Conjecture for 2-DFA Reductions. Int. J. Found. Comput. Sci. 7 (4) (1996)
Manindra Agrawal, Thomas Thierauf
The Boolean Isomorphism Problem. FOCS (1996)
Manindra Agrawal
NSPACE(n): A Degree Theoretic Characterization. Computational Complexity Conference (1995)
Manindra Agrawal, Vikraman Arvind
Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. Computational Complexity Conference (1995)
Manindra Agrawal
On the Isomorphism Problem for Weak Reducibilities. Computational Complexity Conference (1994)
Manindra Agrawal, Vikraman Arvind
Polynomial Time Truth-Table Reductions to P-Selective Sets. Computational Complexity Conference (1994)
Manindra Agrawal, Somenath Biswas
Polynomial Isomorphism of 1-L-Complete Sets. Computational Complexity Conference (1993)
Manindra Agrawal, Somenath Biswas
Universal Relations. Computational Complexity Conference (1992)
Manindra Agrawal
NP-hard Sets and Creativeness over Constant Time Languages. FSTTCS (1991)