Nitin Saxena

	2009
19		Chandan Saha, Ramprasad Saptharishi, Nitin Saxena: The Power of Depth 2 Circuits over Algebras CoRR abs/0904.2058: (2009)
18		Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Deterministic Polynomial Time Algorithms for Matrix Completion Problems CoRR abs/0907.0774: (2009)
	2008
17		Nitin Saxena: Diagonal Circuit Identity Testing and Lower Bounds. ICALP (1) 2008: 60-71
16		Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for Deterministic Polynomial Factoring CoRR abs/0804.1974: (2008)
15		Nitin Saxena, C. Seshadhri: An Almost Optimal Rank Bound for Depth-3 Identities CoRR abs/0811.3161: (2008)
14		Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena: Trading GRH for algebra: algorithms for factoring polynomials and related structures CoRR abs/0811.3165: (2008)
13		Gábor Ivanyos, Marek Karpinski, Nitin Saxena: Schemes for Deterministic Polynomial Factoring. Electronic Colloquium on Computational Complexity (ECCC) 15(043): (2008)
12		Gábor Ivanyos, Marek Karpinski, Lajos Rónyai, Nitin Saxena: Trading GRH for algebra: algorithms for factoring polynomials and related structures. Electronic Colloquium on Computational Complexity (ECCC) 15(099): (2008)
11		Nitin Saxena, C. Seshadhri: An Almost Optimal Rank Bound for Depth-3 Identities. Electronic Colloquium on Computational Complexity (ECCC) 15(108): (2008)
	2007
10		Nitin Saxena: Diagonal Circuit Identity Testing and Lower Bounds. Algebraic Methods in Computational Complexity 2007
9		Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits. Computational Complexity 16(2): 115-138 (2007)
8		Nitin Saxena: Diagonal Circuit Identity Testing and Lower Bounds. Electronic Colloquium on Computational Complexity (ECCC) 14(124): (2007)
	2006
7		Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits. IEEE Conference on Computational Complexity 2006: 9-17
6		Manindra Agrawal, Nitin Saxena: Equivalence of F-Algebras and Cubic Forms. STACS 2006: 115-126
5		Neeraj Kayal, Nitin Saxena: Complexity of Ring Morphism Problems. Computational Complexity 15(4): 342-390 (2006)
	2005
4		Neeraj Kayal, Nitin Saxena: On the Ring Isomorphism and Automorphism Problems. IEEE Conference on Computational Complexity 2005: 2-12
3		Manindra Agrawal, Nitin Saxena: Automorphisms of Finite Rings and Applications to Complexity of Problems. STACS 2005: 1-17
2		Neeraj Kayal, Nitin Saxena: Polynomial Identity Testing for Depth 3 Circuits Electronic Colloquium on Computational Complexity (ECCC)(150): (2005)
	2004
1		Neeraj Kayal, Nitin Saxena: On the Ring Isomorphism & Automorphism Problems Electronic Colloquium on Computational Complexity (ECCC)(109): (2004)

Coauthor Index

1	Manindra Agrawal	[3] [6]
2	Gábor Ivanyos	[12] [13] [14] [16] [18]
3	Marek Karpinski	[12] [13] [14] [16] [18]
4	Neeraj Kayal	[1] [2] [4] [5] [7] [9]
5	Lajos Rónyai	[12] [14]
6	Chandan Saha	[19]
7	Ramprasad Saptharishi	[19]
8	C. Seshadhri	[11] [15]

Colors in the list of coauthors