Samir Datta, Ph.D. - Publications

Affiliations: 
2004 Rutgers University, New Brunswick, New Brunswick, NJ, United States 
Area:
Computer Science

5 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2013 Das B, Datta S, Nimbhorkar P. Log-Space Algorithms for Paths and Matchings in k-Trees Theory of Computing Systems \/ Mathematical Systems Theory. 53: 669-689. DOI: 10.1007/S00224-013-9469-9  0.412
2012 Datta S, Mahajan M, Rao BVR, Thomas M, Vollmer H. Counting classes and the fine structure between NC1 and L Theoretical Computer Science. 417: 36-49. DOI: 10.1016/J.Tcs.2011.05.050  0.307
2012 Datta S, Kulkarni R, Tewari R, Vinodchandran NV. Space complexity of perfect matching in bounded genus bipartite graphs Journal of Computer and System Sciences. 78: 765-779. DOI: 10.1016/J.Jcss.2011.11.002  0.442
2010 Datta S, Kulkarni R, Limaye N, Mahajan M. Planarity, Determinants, Permanents, and (Unique) Matchings Acm Transactions On Computation Theory. 1: 10. DOI: 10.1145/1714450.1714453  0.469
2009 Allender E, Barrington DAM, Chakraborty T, Datta S, Roy S. Planar and grid graph reachability problems Theory of Computing Systems. 45: 675-723. DOI: 10.1007/S00224-009-9172-Z  0.473
Show low-probability matches.