2008 |
23 | EE | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space.
FSTTCS 2008 |
22 | EE | Samir Datta,
Raghav Kulkarni,
Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.
STACS 2008: 229-240 |
21 | EE | Samir Datta,
Raghav Kulkarni,
Sambuddha Roy:
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs
CoRR abs/0802.2850: (2008) |
20 | EE | Samir Datta,
Nutan Limaye,
Prajakta Nimbhorkar:
3-connected Planar Graph Isomorphism is in Log-space
CoRR abs/0806.1041: (2008) |
19 | EE | 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 | EE | Samir Datta,
Raghav Kulkarni,
Nutan Limaye,
Meena Mahajan:
Planarity, Determinants, Permanents, and (Unique) Matchings.
CSR 2007: 115-126 |
2006 |
17 | EE | Tanmoy Chakraborty,
Samir Datta:
One-Input-Face MPCVP Is Hard for L, But in LogDCFL.
FSTTCS 2006: 57-68 |
16 | 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 |
15 | EE | 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 | 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) |