Samir Datta

	2012
49		Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari: Improved Bounds for Bipartite Matching on Surfaces. STACS 2012: 254-265
48		Samir Datta, Rameshwar Pratap: Computing Bits of Algebraic Numbers. TAMC 2012: 189-201
47		Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran: Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. 78(3): 765-779 (2012)
46		Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer: Counting classes and the fine structure between NC1 and L. Theor. Comput. Sci. 417: 36-49 (2012)
	2011
45		Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer: Verifying Proofs in Constant Depth. MFCS 2011: 84-95
44		Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS 2011: 579-590
43		Samir Datta, Nagarajan Krishnamurthy: Some Tractable Win-Lose Games. TAMC 2011: 365-376
42		Samir Datta, Gautam Prakriya: Planarity Testing Revisited. TAMC 2011: 540-551
41		Samir Datta, Gautam Prakriya: Planarity Testing Revisited CoRR abs/1101.2637: (2011)
40		Samir Datta, Rameshwar Pratap: Computing Bits of Algebraic Numbers CoRR abs/1112.4295: (2011)
39		Samir Datta, Gautam Prakriya: Planarity Testing Revisited. Electronic Colloquium on Computational Complexity (ECCC) 18: 9 (2011)
	2010
38		Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer: Counting Classes and the Fine Structure between NC1 and L. MFCS 2010: 306-317
37		Bireswar Das, Samir Datta, Prajakta Nimbhorkar: Log-space Algorithms for Paths and Matchings in k-trees. STACS 2010: 215-226
36		Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs CoRR abs/1004.5080: (2010)
35		Samir Datta, Nagarajan Krishnamurthy: Some Tractable Win-Lose Games CoRR abs/1010.5951: (2010)
34		Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer: Counting Classes and the Fine Structure between NC1 and L. Electronic Colloquium on Computational Complexity (ECCC) 17: 101 (2010)
33		Samir Datta, Raghav Kulkarni, Raghunath Tewari: Perfect Matching in Bipartite Planar Graphs is in UL. Electronic Colloquium on Computational Complexity (ECCC) 17: 201 (2010)
32		Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner: Graph Isomorphism for K{3, 3}-free and K5-free graphs is in Log-space. Electronic Colloquium on Computational Complexity (ECCC) 17: 50 (2010)
31		Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran: Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electronic Colloquium on Computational Complexity (ECCC) 17: 79 (2010)
30		Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. TOCT 1(3): (2010)
29		Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Theory Comput. Syst. 47(3): 737-757 (2010)
	2009
28		Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner: Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. FSTTCS 2009: 145-156
27		Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner: Planar Graph Isomorphism is in Log-Space. IEEE Conference on Computational Complexity 2009: 203-214
26		Bireswar Das, Samir Datta, Prajakta Nimbhorkar: Log-space Algorithms for Paths and Matchings in k-trees CoRR abs/0912.4602: (2009)
25		Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf: Planar Graph Isomorphism is in Log-space. Electronic Colloquium on Computational Complexity (ECCC) 16: 52 (2009)
24		Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Planar and Grid Graph Reachability Problems. Theory Comput. Syst. 45(4): 675-723 (2009)
	2008
23		Samir Datta, Nutan Limaye, Prajakta Nimbhorkar: 3-connected Planar Graph Isomorphism is in Log-space. FSTTCS 2008: 155-162
22		Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS 2008: 229-240
21		Samir Datta, Raghav Kulkarni, Sambuddha Roy: Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs CoRR abs/0802.2850: (2008)
20		Samir Datta, Nutan Limaye, Prajakta Nimbhorkar: 3-connected Planar Graph Isomorphism is in Log-space CoRR abs/0806.1041: (2008)
19		Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner: A Log-space Algorithm for Canonization of Planar Graphs CoRR abs/0809.2319: (2008)
	2007
18		Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan: Planarity, Determinants, Permanents, and (Unique) Matchings. CSR 2007: 115-126
	2006
17		Tanmoy Chakraborty, Samir Datta: One-Input-Face MPCVP Is Hard for L, But in LogDCFL. FSTTCS 2006: 57-68
16		Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy: Grid Graph Reachability Problems. IEEE Conference on Computational Complexity 2006: 299-313
15		Tanmoy Chakraborty, Samir Datta: One-input-face MPCVP is Hard for L, but in LogDCFL. Electronic Colloquium on Computational Complexity (ECCC) 13(130): (2006)
	2005
14		Eric Allender, Samir Datta, Sambuddha Roy: The Directed Planar Reachability Problem. FSTTCS 2005: 238-249
13		Rohit Naik, Subir K. Biswas, Samir Datta: Distributed Sleep-Scheduling Protocols for Energy Conservation in Wireless Networks. HICSS 2005
12		Eric Allender, Samir Datta, Sambuddha Roy: Topology Inside NC¹. IEEE Conference on Computational Complexity 2005: 298-307
11		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		Eric Allender, Samir Datta, Sambuddha Roy: The Directed Planar Reachability Problem Electronic Colloquium on Computational Complexity (ECCC)(148): (2005)
9		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		Eric Allender, Samir Datta, Sambuddha Roy: Topology inside NC1 Electronic Colloquium on Computational Complexity (ECCC)(108): (2004)
	2000
7		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		Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh: Bounded Depth Arithmetic Circuits: Counting and Closure. ICALP 1999: 149-158
4		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		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		Manindra Agrawal, Eric Allender, Samir Datta: On TC0, AC0, and Arithmetic Circuits. IEEE Conference on Computational Complexity 1997: 134-148
1		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] [16] [24]
3	Andris Ambainis	[4] [5]
4	David A. Mix Barrington	[4] [5] [9] [16] [24]
5	Olaf Beyersdorff	[45]
6	Subir K. Biswas	[13]
7	Tanmoy Chakraborty	[9] [15] [16] [17] [24]
8	Bireswar Das	[26] [37]
9	Mustafa Demirhan	[11]
10	Arjun Gopalan	[49]
11	Nagarajan Krishnamurthy	[35] [43]
12	Raghav Kulkarni	[18] [21] [22] [29] [30] [31] [33] [36] [44] [47] [49]
13	Huong LeThanh	[4] [5]
14	Nutan Limaye	[18] [19] [20] [23] [25] [27] [30]
15	Meena Mahajan	[18] [30] [34] [38] [45] [46]
16	Siun-Chuon Mau (Siun Mau)	[11]
17	Rohit Naik	[13]
18	Prajakta Nimbhorkar	[19] [20] [23] [25] [26] [27] [28] [32] [37]
19	Gautam Prakriya	[39] [41] [42]
20	Rameshwar Pratap	[40] [48]
21	B. V. Raghavendra Rao	[34] [38] [46]
22	Dipankar Raychaudhuri	[11]
23	Sambuddha Roy	[8] [9] [10] [12] [14] [16] [21] [22] [24] [29]
24	Gido Scharfenberger-Fabian	[45]
25	Ivan Seskar	[11]
26	Karteek Sreenivasaiah	[45]
27	Raghunath Tewari	[31] [33] [36] [44] [47] [49]
28	Thomas Thierauf	[19] [25] [27] [28] [32]
29	Michael Thomas	[34] [38] [45] [46]
30	N. V. Vinodchandran (N. Variyam Vinodchandran)	[31] [36] [44] [47]
31	Heribert Vollmer	[3] [7] [34] [38] [45] [46]
32	Fabian Wagner	[19] [25] [27] [28] [32]
33	Klaus W. Wagner	[3] [7]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page