The SCEAS System
| |||||||

## Search the dblp DataBase
Samir Datta:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Manindra Agrawal, Eric Allender, Samir Datta
**On TC**[Citation Graph (0, 0)][DBLP]^{0}, AC^{0}, and Arithmetic Circuits. IEEE Conference on Computational Complexity, 1997, pp:134-148 [Conf] - Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
**Grid Graph Reachability Problems.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2006, pp:299-313 [Conf] - Eric Allender, Samir Datta, Sambuddha Roy
**Topology Inside NC¹.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:298-307 [Conf] - Eric Allender, Samir Datta, Sambuddha Roy
**The Directed Planar Reachability Problem.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2005, pp:238-249 [Conf] - Tanmoy Chakraborty, Samir Datta
**One-Input-Face MPCVP Is Hard for L, But in LogDCFL.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2006, pp:57-68 [Conf] - Rohit Naik, Subir K. Biswas, Samir Datta
**Distributed Sleep-Scheduling Protocols for Energy Conservation in Wireless Networks.**[Citation Graph (0, 0)][DBLP] HICSS, 2005, pp:- [Conf] - Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh
**Bounded Depth Arithmetic Circuits: Counting and Closure.**[Citation Graph (0, 0)][DBLP] ICALP, 1999, pp:149-158 [Conf] - Samir Datta, Ivan Seskar, Mustafa Demirhan, Siun-Chuon Mau, Dipankar Raychaudhuri
**Ad-Hoc Extensions to the 802.15.3 MAC Protocol.**[Citation Graph (0, 0)][DBLP] WOWMOM, 2005, pp:293-298 [Conf] - Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner
**Characterizing Small Depth and Small Space Classes by Operators of Higher Type.**[Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 2000, v:2000, n:, pp:- [Journal] - Eric Allender, Samir Datta, Sambuddha Roy
**Topology inside NC**[Citation Graph (0, 0)][DBLP]^{1} Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:108, pp:- [Journal] - Eric Allender, Samir Datta, Sambuddha Roy
**The Directed Planar Reachability Problem**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:148, pp:- [Journal] - Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
**Grid Graph Reachability Problems**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:149, pp:- [Journal] - Manindra Agrawal, Eric Allender, Samir Datta
**On TC**[Citation Graph (0, 0)][DBLP]^{0}, AC^{0}, and Arithmetic Circuits Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:16, pp:- [Journal] - Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner
**Characterizing Small Depth and Small Space Classes by Operators of Higher Types**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:57, pp:- [Journal] - Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh
**Bounded Depth Arithmetic Circuits: Counting and Closure**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:12, pp:- [Journal] - Manindra Agrawal, Eric Allender, Samir Datta
**On TC**[Citation Graph (0, 0)][DBLP]^{0}, AC^{0}, and Arithmetic Circuits. J. Comput. Syst. Sci., 2000, v:60, n:2, pp:395-421 [Journal] - Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
**Planarity, Determinants, Permanents, and (Unique) Matchings.**[Citation Graph (0, 0)][DBLP] CSR, 2007, pp:115-126 [Conf] **Planar Graph Isomorphism is in Log-Space.**[Citation Graph (, )][DBLP]**3-connected Planar Graph Isomorphism is in Log-space.**[Citation Graph (, )][DBLP]**Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space.**[Citation Graph (, )][DBLP]**Counting Classes and the Fine Structure between NC**[Citation Graph (, )][DBLP]^{1}and L.**Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.**[Citation Graph (, )][DBLP]**Log-space Algorithms for Paths and Matchings in k-trees.**[Citation Graph (, )][DBLP]**Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs**[Citation Graph (, )][DBLP]**3-connected Planar Graph Isomorphism is in Log-space**[Citation Graph (, )][DBLP]**A Log-space Algorithm for Canonization of Planar Graphs**[Citation Graph (, )][DBLP]**Log-space Algorithms for Paths and Matchings in k-trees**[Citation Graph (, )][DBLP]**Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs**[Citation Graph (, )][DBLP]**One-input-face MPCVP is Hard for L, but in LogDCFL.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |