Samir Datta - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Log-space Algorithms for Paths and Matchings in k-treesBireswar Das, Samir Datta, Prajakta Nimbhorkar. STACS 2010: 215-226 [doi]

Planarity, Determinants, Permanents, and (Unique) MatchingsSamir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan. toct, 1(3), 2010. [doi]

Counting Classes and the Fine Structure between NC:::1::: and LSamir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer. eccc, 17:101, 2010. [doi]

Counting Classes and the Fine Structure between NC:::1::: and LSamir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer. mfcs 2010: 306-317 [doi]

Perfect Matching in Bipartite Planar Graphs is in ULSamir Datta, Raghav Kulkarni, Raghunath Tewari. eccc, 17:201, 2010. [doi]

Deterministically Isolating a Perfect Matching in Bipartite Planar GraphsSamir Datta, Raghav Kulkarni, Sambuddha Roy. mst, 47(3):737-757, 2010. [doi]

Graph Isomorphism for K::{3, 3}::-free and K::5::-free graphs is in Log-spaceSamir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner. eccc, 17:50, 2010. [doi]

Space Complexity of Perfect Matching in Bounded Genus Bipartite GraphsSamir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran. eccc, 17:79, 2010. [doi]

2009

2008

3-connected Planar Graph Isomorphism is in Log-spaceSamir Datta, Nutan Limaye, Prajakta Nimbhorkar. fsttcs 2008: [doi]

Deterministically Isolating a Perfect Matching in Bipartite Planar GraphsSamir Datta, Raghav Kulkarni, Sambuddha Roy. STACS 2008: 229-240 [doi]

2007

Planarity, Determinants, Permanents, and (Unique) MatchingsSamir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan. csr 2007: 115-126 [doi]

2006

Grid Graph Reachability ProblemsEric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy. cocoon 2006: 299-313 [doi]

One-Input-Face MPCVP Is Hard for L, But in LogDCFLTanmoy Chakraborty, Samir Datta. fsttcs 2006: 57-68 [doi]

One-input-face MPCVP is Hard for L, but in LogDCFLTanmoy Chakraborty, Samir Datta. eccc, 13(130), 2006. [doi]

2005

2004

Topology inside NC:::1:::Eric Allender, Samir Datta, Sambuddha Roy. eccc, (108), 2004. [doi]

2000

On TC:::0:::, AC:::0:::, and Arithmetic CircuitsManindra Agrawal, Eric Allender, Samir Datta. jcss, 60(2):395-421, 2000.

Characterizing Small Depth and Small Space Classes by Operators of Higher TypeManindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner. cjtcs, 2000, 2000. [doi]

1999

Bounded Depth Arithmetic Circuits: Counting and ClosureEric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh. icalp 1999: 149-158 [doi]

Bounded Depth Arithmetic Circuits: Counting and ClosureEric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh. eccc, 6(12), 1999. [doi]

1998

Characterizing Small Depth and Small Space Classes by Operators of Higher TypesManindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner. eccc, 5(57), 1998. [doi]

1997

On TC:::0:::, AC:::0:::, and Arithmetic CircuitsManindra Agrawal, Eric Allender, Samir Datta. eccc, 4(16), 1997. [doi]

On TC:::0:::, AC:::0:::, and Arithmetic CircuitsManindra Agrawal, Eric Allender, Samir Datta. cocoon 1997: 134-148 [doi]