Manindra Agrawal

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