The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Samir Datta: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manindra Agrawal, Eric Allender, Samir Datta
    On TC0, AC0, and Arithmetic Circuits. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1997, pp:134-148 [Conf]
  2. 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]
  3. Eric Allender, Samir Datta, Sambuddha Roy
    Topology Inside NC¹. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:298-307 [Conf]
  4. Eric Allender, Samir Datta, Sambuddha Roy
    The Directed Planar Reachability Problem. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:238-249 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. Eric Allender, Samir Datta, Sambuddha Roy
    Topology inside NC1 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:108, pp:- [Journal]
  11. 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]
  12. 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]
  13. Manindra Agrawal, Eric Allender, Samir Datta
    On TC0, AC0, and Arithmetic Circuits [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:16, pp:- [Journal]
  14. 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]
  15. 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]
  16. Manindra Agrawal, Eric Allender, Samir Datta
    On TC0, AC0, and Arithmetic Circuits. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:2, pp:395-421 [Journal]
  17. 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]

  18. Planar Graph Isomorphism is in Log-Space. [Citation Graph (, )][DBLP]


  19. 3-connected Planar Graph Isomorphism is in Log-space. [Citation Graph (, )][DBLP]


  20. Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. [Citation Graph (, )][DBLP]


  21. Counting Classes and the Fine Structure between NC1 and L. [Citation Graph (, )][DBLP]


  22. Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. [Citation Graph (, )][DBLP]


  23. Log-space Algorithms for Paths and Matchings in k-trees. [Citation Graph (, )][DBLP]


  24. Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs [Citation Graph (, )][DBLP]


  25. 3-connected Planar Graph Isomorphism is in Log-space [Citation Graph (, )][DBLP]


  26. A Log-space Algorithm for Canonization of Planar Graphs [Citation Graph (, )][DBLP]


  27. Log-space Algorithms for Paths and Matchings in k-trees [Citation Graph (, )][DBLP]


  28. Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs [Citation Graph (, )][DBLP]


  29. One-input-face MPCVP is Hard for L, but in LogDCFL. [Citation Graph (, )][DBLP]


Search in 0.727secs, Finished in 0.729secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002