default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManindra Agrawal
Person information
- affiliation: Indian Institute of Technology Kanpur, India
- award (2006): Gödel Prize
- award (2006): Fulkerson Prize
- award: Humboldt Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2019
[j25]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: 28-50 (2019)- 2018
- [j24]Yoshinori Aono, Manindra Agrawal, Takakazu Satoh, Osamu Watanabe:
On the optimality of lattices for the coppersmith technique. Appl. Algebra Eng. Commun. Comput. 29(2): 169-195 (2018) - 2017
- [j23]Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar:
Dimension, pseudorandomness and extraction of pseudorandomness. Comput. 6(3): 277-305 (2017) - 2016
- [j22]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): 1533-1562 (2016) - 2015
- [j21]Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan:
Approximate Verification of the Symbolic Dynamics of Markov Chains. J. ACM 62(1): 2:1-2:34 (2015) - [j20]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. SIAM J. Comput. 44(3): 669-697 (2015) - 2014
- [j19]George Barmpalias, Manindra Agrawal, S. Barry Cooper:
Theory and Applications of Models of Computation at the Turing Centenary in China. Theor. Comput. Sci. 560: 107 (2014) - 2011
- [j18]Manindra Agrawal:
The isomorphism conjecture for constant depth reductions. J. Comput. Syst. Sci. 77(1): 3-13 (2011) - [j17]Manindra Agrawal, Angsheng Li:
Theory and applications of models of computation (TAMC 2008). Theor. Comput. Sci. 412(18): 1645 (2011) - 2010
- [j16]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): 705-706 (2010) - 2003
- [j15]Manindra Agrawal, Somenath Biswas:
Primality and identity testing via Chinese remaindering. J. ACM 50(4): 429-443 (2003) - 2002
- [j14]Manindra Agrawal:
For completeness, sublogarithmic space is no space. Inf. Process. Lett. 82(6): 321-325 (2002) - 2001
- [j13]Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich:
Reducing the complexity of reductions. Comput. Complex. 10(2): 117-138 (2001) - 2000
- [j12]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) - [j11]Manindra Agrawal, Eric Allender, Samir Datta:
On TC0, AC0, and Arithmetic Circuits. J. Comput. Syst. Sci. 60(2): 395-421 (2000) - [j10]Manindra Agrawal, Thomas Thierauf:
The Formula Isomorphism Problem. SIAM J. Comput. 30(3): 990-1009 (2000) - 1998
- [j9]Manindra Agrawal, Eric Allender, Steven Rudich:
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. J. Comput. Syst. Sci. 57(2): 127-143 (1998) - 1997
- [j8]Manindra Agrawal:
DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization. J. Comput. Syst. Sci. 54(3): 383-392 (1997) - 1996
- [j7]Manindra Agrawal, Vikraman Arvind:
A Note on Decision versus Search for Graph Automorphism. Inf. Comput. 131(2): 179-189 (1996) - [j6]Manindra Agrawal, Srinivasan Venkatesh:
On the Isomorphism Conjecture for 2-DFA Reductions. Int. J. Found. Comput. Sci. 7(4): 339-352 (1996) - [j5]Manindra Agrawal, Somenath Biswas:
Polynomial-Time Isomorphism of 1-L-Complete Sets. J. Comput. Syst. Sci. 53(2): 155-160 (1996) - [j4]Manindra Agrawal:
On the Isomorphism Conjecture for Weak Reducibilities. J. Comput. Syst. Sci. 53(2): 267-282 (1996) - [j3]Manindra Agrawal, Somenath Biswas:
NP-Creative Sets: A New Class of Creative Sets in NP. Math. Syst. Theory 29(5): 487-505 (1996) - [j2]Manindra Agrawal, Vikraman Arvind:
Geometric Sets of Low Information Content. Theor. Comput. Sci. 158(1&2): 193-219 (1996) - [j1]Manindra Agrawal, Vikraman Arvind:
Quasi-Linear Truth-Table Reductions to p-Selective Sets. Theor. Comput. Sci. 158(1&2): 361-370 (1996)
Conference and Workshop Papers
- 2021
- [c41]Manindra Agrawal, Madhuri Kanitkar, Mathukumalli Vidyasagar:
SUTRA: An Approach to Modelling Pandemics with Undetected (Asymptomatic) Patients, and Applications to COVID-19. CDC 2021: 3531 - 2018
- [c40]Manindra Agrawal, Sumanta Ghosh, Nitin Saxena:
Bootstrapping variables in algebraic circuits. STOC 2018: 1166-1179 - 2016
- [c39]Manindra Agrawal, Nitin Saxena, Shubham Sahai Srivastava:
Integer Factoring Using Small Algebraic Dependencies. MFCS 2016: 6:1-6:14 - 2015
- [c38]Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar:
Dimension, Pseudorandomness and Extraction of Pseudorandomness. FSTTCS 2015: 221-235 - 2014
- [c37]T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper:
A Roadmap for TAMC. TAMC 2014: 1-6 - 2013
- [c36]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: 1-11 - [c35]Manindra Agrawal, Chandan Saha, Nitin Saxena:
Quasi-polynomial hitting-set for set-depth-Δ formulas. STOC 2013: 321-330 - 2012
- [c34]Yoshinori Aono, Manindra Agrawal, Takakazu Satoh, Osamu Watanabe:
On the Optimality of Lattices for the Coppersmith Technique. ACISP 2012: 376-389 - [c33]Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan:
Approximate Verification of the Symbolic Dynamics of Markov Chains. LICS 2012: 55-64 - [c32]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: 599-614 - 2011
- [c31]Manindra Agrawal:
On the Arithmetic Complexity of Euler Function. CSR 2011: 43-49 - 2009
- [c30]Manindra Agrawal, Osamu Watanabe:
One-Way Functions and the Berman-Hartmanis Conjecture. CCC 2009: 194-202 - 2008
- [c29]Manindra Agrawal, V. Vinay:
Arithmetic Circuits: A Chasm at Depth Four. FOCS 2008: 67-75 - 2007
- [c28]Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf:
The Polynomially Bounded Perfect Matching Problem Is in NC 2. STACS 2007: 489-499 - 2006
- [c27]Manindra Agrawal, Frank Stephan, P. S. Thiagarajan, Shaofa Yang:
Behavioural Approximations for Restricted Linear Differential Hybrid Automata. HSCC 2006: 4-18 - [c26]Manindra Agrawal:
Primality Tests Based on Fermat's Little Theorem. ICDCN 2006: 288-293 - [c25]Manindra Agrawal, Nitin Saxena:
Equivalence of F-Algebras and Cubic Forms. STACS 2006: 115-126 - 2005
- [c24]Manindra Agrawal:
Proving Lower Bounds Via Pseudo-random Generators. FSTTCS 2005: 92-105 - [c23]Manindra Agrawal, P. S. Thiagarajan:
The Discrete Time Behavior of Lazy Linear Hybrid Automata. HSCC 2005: 55-69 - [c22]Manindra Agrawal, Nitin Saxena:
Automorphisms of Finite Rings and Applications to Complexity of Problems. STACS 2005: 1-17 - 2004
- [c21]Manindra Agrawal, P. S. Thiagarajan:
Lazy Rectangular Hybrid Automata. HSCC 2004: 1-15 - 2003
- [c20]Manindra Agrawal:
On Derandomizing Tests for Certain Polynomial Identities. CCC 2003: 355- - 2002
- [c19]Manindra Agrawal:
Pseudo-Random Generators and Structure of Complete Degrees. CCC 2002: 139-147 - 2001
- [c18]Manindra Agrawal:
Towards Uniform AC0 - Isomorphisms. CCC 2001: 13-20 - [c17]Manindra Agrawal:
Hard Sets and Pseudo-random Generators for Constant Depth Circuits. FSTTCS 2001: 58-69 - [c16]Manindra Agrawal:
The First-Order Isomorphism Theorem. FSTTCS 2001: 70-82 - 1999
- [c15]Manindra Agrawal, Somenath Biswas:
Primality and Identity Testing via Chinese Remaindering. FOCS 1999: 202-209 - 1998
- [c14]Manindra Agrawal, Thomas Thierauf:
The Satisfiability Problem for Probabilistic Ordered Branching Programs. CCC 1998: 81- - 1997
- [c13]Manindra Agrawal, Eric Allender, Samir Datta:
On TC0, AC0, and Arithmetic Circuits. CCC 1997: 134-148 - [c12]Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich:
Reducing the Complexity of Reductions. STOC 1997: 730-738 - 1996
- [c11]Manindra Agrawal, Eric Allender:
An Isomorphism Theorem for Circuit Complexity. CCC 1996: 2-11 - [c10]Manindra Agrawal, Vikraman Arvind:
A Note on Decision versus Search for Graph Automorphism. CCC 1996: 272-277 - [c9]Manindra Agrawal, Thomas Thierauf:
The Boolean Isomorphism Problem. FOCS 1996: 422-430 - [c8]Manindra Agrawal, Richard Beigel, Thomas Thierauf:
Pinpointing Computation with Modular Queries in the Boolean Hierarchy. FSTTCS 1996: 322-334 - 1995
- [c7]Manindra Agrawal, Vikraman Arvind:
Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. SCT 1995: 264-276 - [c6]Manindra Agrawal:
DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization. SCT 1995: 315-323 - 1994
- [c5]Manindra Agrawal, Vikraman Arvind:
Polynomial Time Truth-Table Reductions to P-Selective Sets. SCT 1994: 24-30 - [c4]Manindra Agrawal:
On the Isomorphism Problem for Weak Reducibilities. SCT 1994: 338-355 - 1993
- [c3]Manindra Agrawal, Somenath Biswas:
Polynomial Isomorphism of 1-L-Complete Sets. SCT 1993: 75-80 - 1992
- [c2]Manindra Agrawal, Somenath Biswas:
Universal Relations. SCT 1992: 207-220 - 1991
- [c1]Manindra Agrawal:
NP-hard Sets and Creativeness over Constant Time Languages. FSTTCS 1991: 224-241
Parts in Books or Collections
- 2012
- [p1]Manindra Agrawal, Frank Stephan, P. S. Thiagarajan, Shaofa Yang:
The Discrete Time Behaviour of Restricted Linear Hybrid Automata. Modern Applications of Automata Theory 2012: 437-456
Editorship
- 2014
- [e6]T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper:
Theory and Applications of Models of Computation - 11th Annual Conference, TAMC 2014, Chennai, India, April 11-13, 2014. Proceedings. Lecture Notes in Computer Science 8402, Springer 2014, ISBN 978-3-319-06088-0 [contents] - 2012
- [e5]Manindra Agrawal, S. Barry Cooper, Angsheng Li:
Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings. Lecture Notes in Computer Science 7287, Springer 2012, ISBN 978-3-642-29951-3 [contents] - 2009
- [e4]Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans:
Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009. Dagstuhl Seminar Proceedings 09421, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - 2008
- [e3]Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf:
Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007. Dagstuhl Seminar Proceedings 07411, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 [contents] - [e2]Manindra Agrawal, Ding-Zhu Du, Zhenhua Duan, Angsheng Li:
Theory and Applications of Models of Computation, 5th International Conference, TAMC 2008, Xi'an, China, April 25-29, 2008. Proceedings. Lecture Notes in Computer Science 4978, Springer 2008, ISBN 978-3-540-79227-7 [contents] - 2002
- [e1]Manindra Agrawal, Anil Seth:
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings. Lecture Notes in Computer Science 2556, Springer 2002, ISBN 3-540-00225-1 [contents]
Informal and Other Publications
- 2020
- [i32]Manindra Agrawal, Rohit Gurjar, Thomas Thierauf:
Impossibility of Derandomizing the Isolation Lemma for all Families. Electron. Colloquium Comput. Complex. TR20 (2020) - 2018
- [i31]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Doerr, Kasper Green Larsen, Kurt Mehlhorn:
The Query Complexity of a Permutation-Based Variant of Mastermind. CoRR abs/1812.08480 (2018) - [i30]Manindra Agrawal, Sumanta Ghosh, Nitin Saxena:
Bootstrapping variables in algebraic circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [i29]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 abs/1702.07180 (2017) - [i28]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. TR17 (2017) - 2014
- [i27]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for ROABP and Sum of Set-Multilinear circuits. CoRR abs/1406.7535 (2014) - [i26]Manindra Agrawal, Valentine Kabanets, Thomas Thierauf, Christopher Umans:
Algebra in Computational Complexity (Dagstuhl Seminar 14391). Dagstuhl Reports 4(9): 85-105 (2014) - [i25]Manindra Agrawal, Diptarka Chakraborty, Debarati Das, Satyadev Nandakumar:
Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness. Electron. Colloquium Comput. Complex. TR14 (2014) - [i24]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for ROABP and Sum of Set-Multilinear circuits. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [i23]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for low-distance multilinear depth-3. CoRR abs/1312.1826 (2013) - [i22]Manindra Agrawal, Rohit Gurjar, Arpita Korwar, Nitin Saxena:
Hitting-sets for low-distance multilinear depth-3. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i21]Manindra Agrawal, Chandan Saha, Nitin Saxena:
Quasi-polynomial Hitting-set for Set-depth-Delta Formulas. CoRR abs/1209.2333 (2012) - [i20]Manindra Agrawal, Thomas Thierauf, Christopher Umans:
Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421). Dagstuhl Reports 2(10): 60-78 (2012) - [i19]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. TR12 (2012) - [i18]Manindra Agrawal, Chandan Saha, Nitin Saxena:
Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas. Electron. Colloquium Comput. Complex. TR12 (2012) - [i17]Yoshinori Aono, Manindra Agrawal, Takakazu Satoh, Osamu Watanabe:
On the Optimality of Lattices for the Coppersmith Technique. IACR Cryptol. ePrint Arch. 2012: 108 (2012) - 2011
- [i16]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 abs/1111.0582 (2011) - [i15]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. TR11 (2011) - 2009
- [i14]Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans:
09421 Abstracts Collection - Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity 2009 - [i13]Manindra Agrawal, Lance Fortnow, Thomas Thierauf, Christopher Umans:
09421 Executive Summary - Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity 2009 - [i12]Manindra Agrawal, Osamu Watanabe:
One-Way Functions and the Isomorphism Conjecture. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [i11]Manindra Agrawal, V. Vinay:
Arithmetic Circuits: A Chasm at Depth Four. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i10]Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf:
07411 Executive Summary -- Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity 2007 - [i9]Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf:
07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity 2007 - 2006
- [i8]Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf:
The polynomially bounded perfect matching problem is in NC^2. Electron. Colloquium Comput. Complex. TR06 (2006) - 1999
- [i7]Manindra Agrawal, Somenath Biswas:
Reducing Randomness via Chinese Remaindering. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [i6]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. TR98 (1998) - 1997
- [i5]Manindra Agrawal, Eric Allender, Samir Datta:
On TC0, AC0, and Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR97 (1997) - [i4]Manindra Agrawal, Thomas Thierauf:
The Satisfiability Problem for Probabilistic Ordered Branching Programs. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [i3]Manindra Agrawal, Richard Beigel, Thomas Thierauf:
Modulo Information from Nonadaptive Queries to NP. Electron. Colloquium Comput. Complex. TR96 (1996) - [i2]Manindra Agrawal, Eric Allender:
An Isomorphism Theorem for Circuit Complexity. Electron. Colloquium Comput. Complex. TR96 (1996) - [i1]Manindra Agrawal, Thomas Thierauf:
The Boolean Isomorphism Problem. Electron. Colloquium Comput. Complex. TR96 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
