Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Manindra Agrawal
2010 – today
- 2013
[c38]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- [c37]Manindra Agrawal, Chandan Saha, Nitin Saxena: Quasi-polynomial hitting-set for set-depth-Δ formulas. STOC 2013: 321-330
- 2012
- [c36]Yoshinori Aono, Manindra Agrawal, Takakazu Satoh, Osamu Watanabe: On the Optimality of Lattices for the Coppersmith Technique. ACISP 2012: 376-389
- [c35]Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan: Approximate Verification of the Symbolic Dynamics of Markov Chains. LICS 2012: 55-64
- [c34]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
- [e4]Manindra Agrawal, S. Barry Cooper, Angsheng Li (Eds.): 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
- [i17]Manindra Agrawal, Chandan Saha, Nitin Saxena: Quasi-polynomial Hitting-set for Set-depth-Delta Formulas. CoRR abs/1209.2333 (2012)
- [i16]Manindra Agrawal, Thomas Thierauf, Christopher Umans: Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421). Dagstuhl Reports 2(10): 60-78 (2012)
- [i15]Peyman Afshani, Manindra Agrawal, Benjamin Doerr, Carola Winzen, Kasper Green Larsen, Kurt Mehlhorn: The Deterministic and Randomized Query Complexity of a Simple Guessing Game. Electronic Colloquium on Computational Complexity (ECCC) 19: 87 (2012)
- [i14]Manindra Agrawal, Chandan Saha, Nitin Saxena: Quasi-polynomial Hitting-set for Set-depth-$\Delta$ Formulas. Electronic Colloquium on Computational Complexity (ECCC) 19: 113 (2012)
- [i13]Yoshinori Aono, Manindra Agrawal, Takakazu Satoh, Osamu Watanabe: On the Optimality of Lattices for the Coppersmith Technique. IACR Cryptology ePrint Archive 2012: 108 (2012)
- 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)
- [c33]
- [i12]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)
- [i11]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. Electronic Colloquium on Computational Complexity (ECCC) 18: 143 (2011)
- 2010
- [j16]Manindra Agrawal, S. Barry Cooper, Angsheng Li: Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009). Mathematical Structures in Computer Science 20(5): 705-706 (2010)
2000 – 2009
- 2009
- [c32]Manindra Agrawal, Osamu Watanabe: One-Way Functions and the Berman-Hartmanis Conjecture. IEEE Conference on Computational Complexity 2009: 194-202
- [i10]Manindra Agrawal, Osamu Watanabe: One-Way Functions and the Isomorphism Conjecture. Electronic Colloquium on Computational Complexity (ECCC) 16: 19 (2009)
- 2008
- [c31]
- [e3]Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf (Eds.): 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
- [e2]Manindra Agrawal, Ding-Zhu Du, Zhenhua Duan, Angsheng Li (Eds.): 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
- [i9]Manindra Agrawal, V. Vinay: Arithmetic Circuits: A Chasm at Depth Four. Electronic Colloquium on Computational Complexity (ECCC) 15(062) (2008)
- 2007
- [c30]Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf: 07411 Executive Summary -- Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity 2007
- [c29]Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf: 07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity 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]
- [c25]
- [i8]Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf: The polynomially bounded perfect matching problem is in NC^2. Electronic Colloquium on Computational Complexity (ECCC) 13(129) (2006)
- 2005
- [c24]
- [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]
- 2003
- [j15]Manindra Agrawal, Somenath Biswas: Primality and identity testing via Chinese remaindering. J. ACM 50(4): 429-443 (2003)
- [c20]Manindra Agrawal: On Derandomizing Tests for Certain Polynomial Identities. IEEE Conference on Computational Complexity 2003: 355-
- 2002
- [j14]Manindra Agrawal: For completeness, sublogarithmic space is no space. Inf. Process. Lett. 82(6): 321-325 (2002)
- [c19]Manindra Agrawal: Pseudo-Random Generators and Structure of Complete Degrees. IEEE Conference on Computational Complexity 2002: 139-147
- [e1]Manindra Agrawal, Anil Seth (Eds.): 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
- 2001
- [j13]Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the complexity of reductions. Computational Complexity 10(2): 117-138 (2001)
- [c18]Manindra Agrawal: Towards Uniform AC0 - Isomorphisms. IEEE Conference on Computational Complexity 2001: 13-20
- [c17]Manindra Agrawal: Hard Sets and Pseudo-random Generators for Constant Depth Circuits. FSTTCS 2001: 58-69
- [c16]
- 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. Chicago 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)
1990 – 1999
- 1999
- [c15]Manindra Agrawal, Somenath Biswas: Primality and Identity Testing via Chinese Remaindering. FOCS 1999: 202-209
- [i7]Manindra Agrawal, Somenath Biswas: Reducing Randomness via Chinese Remaindering. Electronic Colloquium on Computational Complexity (ECCC) 6(18) (1999)
- 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)
- [c14]Manindra Agrawal, Thomas Thierauf: The Satisfiability Problem for Probabilistic Ordered Branching Programs. IEEE Conference on Computational Complexity 1998: 81-
- [i6]Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner: Characterizing Small Depth and Small Space Classes by Operators of Higher Types. Electronic Colloquium on Computational Complexity (ECCC) 5(57) (1998)
- 1997
- [j8]Manindra Agrawal: DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization. J. Comput. Syst. Sci. 54(3): 383-392 (1997)
- [c13]Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. IEEE Conference on Computational Complexity 1997: 134-148
- [c12]Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the Complexity of Reductions. STOC 1997: 730-738
- [i5]Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. Electronic Colloquium on Computational Complexity (ECCC) 4(16) (1997)
- [i4]Manindra Agrawal, Thomas Thierauf: The Satisfiability Problem for Probabilistic Ordered Branching Programs. Electronic Colloquium on Computational Complexity (ECCC) 4(60) (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. Mathematical Systems 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)
- [c11]Manindra Agrawal, Eric Allender: An Isomorphism Theorem for Circuit Complexity. IEEE Conference on Computational Complexity 1996: 2-11
- [c10]Manindra Agrawal, Vikraman Arvind: A Note on Decision versus Search for Graph Automorphism. IEEE Conference on Computational Complexity 1996: 272-277
- [c9]
- [c8]Manindra Agrawal, Richard Beigel, Thomas Thierauf: Pinpointing Computation with Modular Queries in the Boolean Hierarchy. FSTTCS 1996: 322-334
- [i3]Manindra Agrawal, Richard Beigel, Thomas Thierauf: Modulo Information from Nonadaptive Queries to NP. Electronic Colloquium on Computational Complexity (ECCC) 3(1) (1996)
- [i2]Manindra Agrawal, Eric Allender: An Isomorphism Theorem for Circuit Complexity. Electronic Colloquium on Computational Complexity (ECCC) 3(2) (1996)
- [i1]Manindra Agrawal, Thomas Thierauf: The Boolean Isomorphism Problem. Electronic Colloquium on Computational Complexity (ECCC) 3(32) (1996)
- 1995
- [c7]Manindra Agrawal, Vikraman Arvind: Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. Structure in Complexity Theory Conference 1995: 264-276
- [c6]Manindra Agrawal: DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization. Structure in Complexity Theory Conference 1995: 315-323
- 1994
- [c5]Manindra Agrawal, Vikraman Arvind: Polynomial Time Truth-Table Reductions to P-Selective Sets. Structure in Complexity Theory Conference 1994: 24-30
- [c4]Manindra Agrawal: On the Isomorphism Problem for Weak Reducibilities. Structure in Complexity Theory Conference 1994: 338-355
- 1993
- [c3]Manindra Agrawal, Somenath Biswas: Polynomial Isomorphism of 1-L-Complete Sets. Structure in Complexity Theory Conference 1993: 75-80
- 1992
- [c2]Manindra Agrawal, Somenath Biswas: Universal Relations. Structure in Complexity Theory Conference 1992: 207-220
- 1991
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:10 CEST by the dblp team