15.On the complexity of algebraic numbers, and the bit-complexity of straight-line programs.
Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap — Comput. — 2023
14.Depth-first search in directed planar graphs, revisited.
Eric Allender, Archit Chauhan, Samir Datta — Acta Informatica — 2022
13.Planar Graph Isomorphism Is in Log-Space.
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner — ACM Trans. Comput. Theory — 2022
12.A Strategy for Dynamic Programs: Start over and Muddle through.
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume — Log. Methods Comput. Sci. — 2019
11.Reachability Is in DynFO.
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume — J. ACM — 2018
10.Log-Space Algorithms for Paths and Matchings in k-Trees.
Bireswar Das, Samir Datta, Prajakta Nimbhorkar — Theory Comput. Syst. — 2013
9.Space complexity: what makes planar graphs special?
Samir Datta, Raghav Kulkarni — Bull. EATCS — 2013
8.Verifying proofs in constant depth.
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer — ACM Trans. Comput. Theory — 2013
7.Counting classes and the fine structure between NC1 and L.
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer — Theor. Comput. Sci. — 2012
6.Space complexity of perfect matching in bounded genus bipartite graphs.
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran — J. Comput. Syst. Sci. — 2012
5.Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.
Samir Datta, Raghav Kulkarni, Sambuddha Roy — Theory Comput. Syst. — 2010
4.Planarity, Determinants, Permanents, and (Unique) Matchings.
Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan — ACM Trans. Comput. Theory — 2010
3.Planar and Grid Graph Reachability Problems.
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy — Theory Comput. Syst. — 2009
2.Characterizing Small Depth and Small Space Classes by Operators of Higher Type.
Manindra Agrawal, Eric Allender, Samir Datta, Heribert Vollmer, Klaus W. Wagner — Chic. J. Theor. Comput. Sci. — 2000
1.On TC0, AC0, and Arithmetic Circuits.
Manindra Agrawal, Eric Allender, Samir Datta — J. Comput. Syst. Sci. — 2000