Samir Datta

2008
19	EE	Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS 2008: 229-240
18	EE	Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs CoRR abs/0802.2850: (2008)
2007
17	EE	Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. CSR 2007: 115-126
2006
16	EE	Tanmoy Chakraborty, Samir Datta: One-Input-Face MPCVP Is Hard for L, But in LogDCFL. FSTTCS 2006: 57-68
15	EE	Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Grid Graph Reachability Problems. IEEE Conference on Computational Complexity 2006: 299-313
2005
14	EE	Eric Allender, Samir Datta, Sambuddha Roy: The Directed Planar Reachability Problem. FSTTCS 2005: 238-249
13	EE	Rohit Naik, Subir K. Biswas, Samir Datta: Distributed Sleep-Scheduling Protocols for Energy Conservation in Wireless Networks. HICSS 2005
12	EE	Eric Allender, Samir Datta, Sambuddha Roy: Topology Inside NC¹. IEEE Conference on Computational Complexity 2005: 298-307
11	EE	Samir Datta, Ivan Seskar, Mustafa Demirhan, Siun-Chuon Mau, Dipankar Raychaudhuri: Ad-Hoc Extensions to the 802.15.3 MAC Protocol. WOWMOM 2005: 293-298
10	EE	Eric Allender, Samir Datta, Sambuddha Roy: The Directed Planar Reachability Problem Electronic Colloquium on Computational Complexity (ECCC)(148): (2005)
9	EE	Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Grid Graph Reachability Problems Electronic Colloquium on Computational Complexity (ECCC)(149): (2005)
2004
8	EE	Eric Allender, Samir Datta, Sambuddha Roy: Topology inside NC1 Electronic Colloquium on Computational Complexity (ECCC)(108): (2004)
2000
7	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)
6		Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. J. Comput. Syst. Sci. 60(2): 395-421 (2000)
1999
5	EE	Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh: Bounded Depth Arithmetic Circuits: Counting and Closure. ICALP 1999: 149-158
4	EE	Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh: Bounded Depth Arithmetic Circuits: Counting and Closure Electronic Colloquium on Computational Complexity (ECCC) 6(12): (1999)
1998
3	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)
1997
2	EE	Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. IEEE Conference on Computational Complexity 1997: 134-148
1	EE	Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits Electronic Colloquium on Computational Complexity (ECCC) 4(16): (1997)

Coauthor Index

1	Manindra Agrawal	[1] [2] [3] [6] [7]
2	Eric Allender	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [12] [14] [15]
3	Andris Ambainis	[4] [5]
4	David A. Mix Barrington	[4] [5] [9] [15]
5	Subir K. Biswas	[13]
6	Tanmoy Chakraborty	[9] [15] [16]
7	Mustafa Demirhan	[11]
8	Raghav Kulkarni	[17] [18] [19]
9	Huong LeThanh	[4] [5]
10	Nutan Limaye	[17]
11	Meena Mahajan	[17]
12	Siun-Chuon Mau	[11]
13	Rohit Naik	[13]
14	Dipankar Raychaudhuri	[11]
15	Sambuddha Roy	[8] [9] [10] [12] [14] [15] [18] [19]
16	Ivan Seskar	[11]
17	Heribert Vollmer	[3] [7]
18	Klaus W. Wagner	[3] [7]

Colors in the list of coauthors