Manindra Agrawal

2008
58		Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf: Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
57		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 Springer 2008
56	EE	Manindra Agrawal, V. Vinay: Arithmetic Circuits: A Chasm at Depth Four. FOCS 2008: 67-75
55	EE	Manindra Agrawal, V. Vinay: Arithmetic Circuits: A Chasm at Depth Four. Electronic Colloquium on Computational Complexity (ECCC) 15(062): (2008)
2007
54	EE	Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf: 07411 Abstracts Collection -- Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity 2007
53	EE	Manindra Agrawal, Harry Buhrman, Lance Fortnow, Thomas Thierauf: 07411 Executive Summary -- Algebraic Methods in Computational Complexity. Algebraic Methods in Computational Complexity 2007
52	EE	Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf: The Polynomially Bounded Perfect Matching Problem Is in NC 2. STACS 2007: 489-499
2006
51	EE	Manindra Agrawal, Frank Stephan, P. S. Thiagarajan, Shaofa Yang: Behavioural Approximations for Restricted Linear Differential Hybrid Automata. HSCC 2006: 4-18
50	EE	Manindra Agrawal: Primality Tests Based on Fermat's Little Theorem. ICDCN 2006: 288-293
49	EE	Manindra Agrawal, Nitin Saxena: Equivalence of F-Algebras and Cubic Forms. STACS 2006: 115-126
48	EE	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
47	EE	Manindra Agrawal: Proving Lower Bounds Via Pseudo-random Generators. FSTTCS 2005: 92-105
46	EE	Manindra Agrawal, P. S. Thiagarajan: The Discrete Time Behavior of Lazy Linear Hybrid Automata. HSCC 2005: 55-69
45	EE	Manindra Agrawal, Nitin Saxena: Automorphisms of Finite Rings and Applications to Complexity of Problems. STACS 2005: 1-17
2004
44	EE	Manindra Agrawal, P. S. Thiagarajan: Lazy Rectangular Hybrid Automata. HSCC 2004: 1-15
2003
43	EE	Manindra Agrawal: On Derandomizing Tests for Certain Polynomial Identities. IEEE Conference on Computational Complexity 2003: 355-
42	EE	Manindra Agrawal, Somenath Biswas: Primality and identity testing via Chinese remaindering. J. ACM 50(4): 429-443 (2003)
2002
41		Manindra Agrawal, Anil Seth: FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002, Proceedings Springer 2002
40	EE	Manindra Agrawal: Pseudo-Random Generators and Structure of Complete Degrees. IEEE Conference on Computational Complexity 2002: 139-147
39	EE	Manindra Agrawal: For completeness, sublogarithmic space is no space. Inf. Process. Lett. 82(6): 321-325 (2002)
2001
38	EE	Manindra Agrawal: Hard Sets and Pseudo-random Generators for Constant Depth Circuits. FSTTCS 2001: 58-69
37	EE	Manindra Agrawal: The First-Order Isomorphism Theorem. FSTTCS 2001: 70-82
36	EE	Manindra Agrawal: Towards Uniform AC0 - Isomorphisms. IEEE Conference on Computational Complexity 2001: 13-20
35	EE	Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the complexity of reductions. Computational Complexity 10(2): 117-138 (2001)
2000
34	EE	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)
33		Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. J. Comput. Syst. Sci. 60(2): 395-421 (2000)
32	EE	Manindra Agrawal, Thomas Thierauf: The Formula Isomorphism Problem. SIAM J. Comput. 30(3): 990-1009 (2000)
1999
31	EE	Manindra Agrawal, Somenath Biswas: Primality and Identity Testing via Chinese Remaindering. FOCS 1999: 202-209
30	EE	Manindra Agrawal, Somenath Biswas: Reducing Randomness via Chinese Remaindering Electronic Colloquium on Computational Complexity (ECCC) 6(18): (1999)
1998
29	EE	Manindra Agrawal, Thomas Thierauf: The Satisfiability Problem for Probabilistic Ordered Branching Programs. IEEE Conference on Computational Complexity 1998: 81-
28	EE	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)
27		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
26	EE	Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. IEEE Conference on Computational Complexity 1997: 134-148
25	EE	Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich: Reducing the Complexity of Reductions. STOC 1997: 730-738
24	EE	Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits Electronic Colloquium on Computational Complexity (ECCC) 4(16): (1997)
23	EE	Manindra Agrawal, Thomas Thierauf: The Satisfiability Problem for Probabilistic Ordered Branching Programs Electronic Colloquium on Computational Complexity (ECCC) 4(60): (1997)
22		Manindra Agrawal: DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization. J. Comput. Syst. Sci. 54(3): 383-392 (1997)
1996
21		Manindra Agrawal, Thomas Thierauf: The Boolean Isomorphism Problem. FOCS 1996: 422-430
20		Manindra Agrawal, Richard Beigel, Thomas Thierauf: Pinpointing Computation with Modular Queries in the Boolean Hierarchy. FSTTCS 1996: 322-334
19	EE	Manindra Agrawal, Eric Allender: An Isomorphism Theorem for Circuit Complexity. IEEE Conference on Computational Complexity 1996: 2-11
18	EE	Manindra Agrawal, Vikraman Arvind: A Note on Decision versus Search for Graph Automorphism. IEEE Conference on Computational Complexity 1996: 272-277
17	EE	Manindra Agrawal, Richard Beigel, Thomas Thierauf: Modulo Information from Nonadaptive Queries to NP Electronic Colloquium on Computational Complexity (ECCC) 3(1): (1996)
16	EE	Manindra Agrawal, Eric Allender: An Isomorphism Theorem for Circuit Complexity Electronic Colloquium on Computational Complexity (ECCC) 3(2): (1996)
15	EE	Manindra Agrawal, Thomas Thierauf: The Boolean Isomorphism Problem Electronic Colloquium on Computational Complexity (ECCC) 3(32): (1996)
14		Manindra Agrawal, Vikraman Arvind: A Note on Decision versus Search for Graph Automorphism. Inf. Comput. 131(2): 179-189 (1996)
13		Manindra Agrawal, Srinivasan Venkatesh: On the Isomorphism Conjecture for 2-DFA Reductions. Int. J. Found. Comput. Sci. 7(4): 339- (1996)
12		Manindra Agrawal, Somenath Biswas: Polynomial-Time Isomorphism of 1-L-Complete Sets. J. Comput. Syst. Sci. 53(2): 155-160 (1996)
11		Manindra Agrawal: On the Isomorphism Conjecture for Weak Reducibilities. J. Comput. Syst. Sci. 53(2): 267-282 (1996)
10		Manindra Agrawal, Somenath Biswas: NP-Creative Sets: A New Class of Creative Sets in NP. Mathematical Systems Theory 29(5): 487-505 (1996)
9	EE	Manindra Agrawal, Vikraman Arvind: Geometric Sets of Low Information Content. Theor. Comput. Sci. 158(1&2): 193-219 (1996)
8	EE	Manindra Agrawal, Vikraman Arvind: Quasi-Linear Truth-Table Reductions to p-Selective Sets. Theor. Comput. Sci. 158(1&2): 361-370 (1996)
1995
7		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
6		Manindra Agrawal: DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization. Structure in Complexity Theory Conference 1995: 315-323
1994
5		Manindra Agrawal, Vikraman Arvind: Polynomial Time Truth-Table Reductions to P-Selective Sets. Structure in Complexity Theory Conference 1994: 24-30
4		Manindra Agrawal: On the Isomorphism Problem for Weak Reducibilities. Structure in Complexity Theory Conference 1994: 338-355
1993
3		Manindra Agrawal, Somenath Biswas: Polynomial Isomorphism of 1-L-Complete Sets. Structure in Complexity Theory Conference 1993: 75-80
1992
2		Manindra Agrawal, Somenath Biswas: Universal Relations. Structure in Complexity Theory Conference 1992: 207-220
1991
1		Manindra Agrawal: NP-hard Sets and Creativeness over Constant Time Languages. FSTTCS 1991: 224-241

Coauthor Index

1	Eric Allender	[16] [19] [24] [25] [26] [27] [28] [33] [34] [35]
2	Vikraman Arvind	[5] [7] [8] [9] [14] [18]
3	Richard Beigel	[17] [20]
4	Somenath Biswas	[2] [3] [10] [12] [30] [31] [42]
5	Harry Buhrman	[53] [54] [58]
6	Samir Datta	[24] [26] [28] [33] [34]
7	Ding-Zhu Du	[57]
8	Zhenhua Duan	[57]
9	Lance Fortnow	[53] [54] [58]
10	Thanh Minh Hoang	[48] [52]
11	Russell Impagliazzo	[25] [35]
12	Angsheng Li	[57]
13	Toniann Pitassi	[25] [35]
14	Steven Rudich	[25] [27] [35]
15	Nitin Saxena	[45] [49]
16	Anil Seth	[41]
17	Frank Stephan	[51]
18	P. S. Thiagarajan	[44] [46] [51]
19	Thomas Thierauf	[15] [17] [20] [21] [23] [29] [32] [48] [52] [53] [54] [58]
20	Srinivasan Venkatesh	[13]
21	V. Vinay	[55] [56]
22	Heribert Vollmer	[28] [34]
23	Klaus W. Wagner	[28] [34]
24	Shaofa Yang	[51]

Colors in the list of coauthors