Characterizing Small Depth and Small Space Classes by Operators of Higher Types - Manindra Agrawal; Eric Allender; Samir Datta; Heribert Vollmer; Klaus W. Wagner (Electron. Colloquium Comput. Complex., 1998)

Bounded Depth Arithmetic Circuits: Counting and Closure - Eric Allender; Andris Ambainis; David A. Mix Barrington; Samir Datta; Huong LeThanh (Electron. Colloquium Comput. Complex., 1999)

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)

On TC0, AC0, and Arithmetic Circuits. - Manindra Agrawal; Eric Allender; Samir Datta (J. Comput. Syst. Sci., 2000)

Reducing overhearing energy in 802.11 networks by low-power interface idling. - Subir Kumar Biswas; Samir Datta (IPCCC, 2004)

Topology inside NC1 - Eric Allender; Samir Datta; Sambuddha Roy (Electron. Colloquium Comput. Complex., 2004)

Topology Inside NC¹. - Eric Allender; Samir Datta; Sambuddha Roy (CCC, 2005)

Distributed Sleep-Scheduling Protocols for Energy Conservation in Wireless Networks. - Rohit Naik; Subir K. Biswas; Samir Datta (HICSS, 2005)

Ad-Hoc Extensions to the 802.15.3 MAC Protocol. - Samir Datta; Ivan Seskar; Mustafa Demirhan; Siun-Chuon Mau; Dipankar Raychaudhuri (WOWMOM, 2005)

The Directed Planar Reachability Problem - Eric Allender; Samir Datta; Sambuddha Roy (Electron. Colloquium Comput. Complex., 2005)

Grid Graph Reachability Problems - Eric Allender; David A. Mix Barrington; Tanmoy Chakraborty 001; Samir Datta; Sambuddha Roy (Electron. Colloquium Comput. Complex., 2005)

One-input-face MPCVP is Hard for L, but in LogDCFL. - Tanmoy Chakraborty 001; Samir Datta (Electron. Colloquium Comput. Complex., 2006)

3-connected Planar Graph Isomorphism is in Log-space. - Samir Datta; Nutan Limaye; Prajakta Nimbhorkar (FSTTCS, 2008)

A Log-space Algorithm for Canonization of Planar Graphs - Samir Datta; Nutan Limaye; Prajakta Nimbhorkar; Thomas Thierauf; Fabian Wagner (CoRR, 2008)

Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. - Samir Datta; Prajakta Nimbhorkar; Thomas Thierauf; Fabian Wagner (FSTTCS, 2009)

Planar Graph Isomorphism is in Log-space. - Fabian Wagner; Samir Datta; Nutan Limaye; Prajakta Nimbhorkar; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2009)

Planar and Grid Graph Reachability Problems. - Eric Allender; David A. Mix Barrington; Tanmoy Chakraborty 001; Samir Datta; Sambuddha Roy (Theory Comput. Syst., 2009)

Perfect Matching in Bipartite Planar Graphs is in UL. - Samir Datta; Raghav Kulkarni; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2010)

Graph Isomorphism for K3,3-free and K5-free graphs is in Log-space. - Samir Datta; Prajakta Nimbhorkar; Thomas Thierauf; Fabian Wagner (Electron. Colloquium Comput. Complex., 2010)

Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. - Samir Datta; Raghav Kulkarni; Sambuddha Roy (Theory Comput. Syst., 2010)

Planarity, Determinants, Permanents, and (Unique) Matchings. - Samir Datta; Raghav Kulkarni; Nutan Limaye; Meena Mahajan (ACM Trans. Comput. Theory, 2010)

Verifying Proofs in Constant Depth. - Olaf Beyersdorff; Samir Datta; Meena Mahajan; Gido Scharfenberger-Fabian; Karteek Sreenivasaiah; Michael Thomas 001; Heribert Vollmer (MFCS, 2011)

Some Tractable Win-Lose Games. - Samir Datta; Nagarajan Krishnamurthy (TAMC, 2011)

Planarity Testing Revisited. - Samir Datta; Gautam Prakriya (Electron. Colloquium Comput. Complex., 2011)

Improved Bounds for Bipartite Matching on Surfaces. - Samir Datta; Arjun Gopalan; Raghav Kulkarni; Raghunath Tewari (STACS, 2012)

Computing Bits of Algebraic Numbers. - Samir Datta; Rameshwar Pratap (TAMC, 2012)

Verifying Proofs in Constant Depth. - Olaf Beyersdorff; Samir Datta; Andreas Krebs; Meena Mahajan; Gido Scharfenberger-Fabian; Karteek Sreenivasaiah; Michael Thomas 001; Heribert Vollmer (Electron. Colloquium Comput. Complex., 2012)

Space complexity of perfect matching in bounded genus bipartite graphs. - Samir Datta; Raghav Kulkarni; Raghunath Tewari; N. V. Vinodchandran (J. Comput. Syst. Sci., 2012)

Counting classes and the fine structure between NC1 and L. - Samir Datta; Meena Mahajan; B. V. Raghavendra Rao; Michael Thomas 001; Heribert Vollmer (Theor. Comput. Sci., 2012)

Tree-width and Logspace: Determinants and Counting Euler Tours. - Nikhil Balaji; Samir Datta (CoRR, 2013)

Space complexity: what makes planar graphs special? - Samir Datta; Raghav Kulkarni (Bull. EATCS, 2013)

Low-depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. - Eric Allender; Nikhil Balaji; Samir Datta (Electron. Colloquium Comput. Complex., 2013)

Collapsing Exact Arithmetic Hierarchies. - Nikhil Balaji; Samir Datta (Electron. Colloquium Comput. Complex., 2013)

Log-Space Algorithms for Paths and Matchings in k-Trees. - Bireswar Das; Samir Datta; Prajakta Nimbhorkar (Theory Comput. Syst., 2013)

Dynamic Complexity of Directed Reachability and Other Problems. - Samir Datta; William Hesse; Raghav Kulkarni (ICALP (1), 2014)

Space Complexity of Optimization Problems in Planar Graphs. - Samir Datta; Raghav Kulkarni (TAMC, 2014)

Counting Euler Tours in Undirected Bounded Treewidth Graphs. - Nikhil Balaji; Samir Datta; Venkatesh Ganesan (FSTTCS, 2015)

Bounded Treewidth and Space-Efficient Linear Algebra. - Nikhil Balaji; Samir Datta (TAMC, 2015)

Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. - Nikhil Balaji; Samir Datta; Raghav Kulkarni; Supartha Podder (MFCS, 2016)

Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. - Samir Datta; Raghav Kulkarni; Anish Mukherjee 001 (MFCS, 2016)

Shortest k-Disjoint Paths via Determinants. - Samir Datta; Siddharth Iyer; Raghav Kulkarni; Anish Mukherjee 001 (FSTTCS, 2018)

Reachability and Distances under Multiple Changes. - Samir Datta; Anish Mukherjee 001; Nils Vortmeier; Thomas Zeume (ICALP, 2018)

Planar Maximum Matching: Towards a Parallel Algorithm. - Samir Datta; Raghav Kulkarni; Ashish Kumar; Anish Mukherjee 001 (ISAAC, 2018)

Reachability Is in DynFO. - Samir Datta; Raghav Kulkarni; Anish Mukherjee 001; Thomas Schwentick; Thomas Zeume (J. ACM, 2018)

Planarity, Exclusivity, and Unambiguity. - Eric Allender; Archit Chauhan; Samir Datta; Anish Mukherjee 001 (Electron. Colloquium Comput. Complex., 2019)

A Strategy for Dynamic Programs: Start over and Muddle through. - Samir Datta; Anish Mukherjee 001; Thomas Schwentick; Nils Vortmeier; Thomas Zeume (Log. Methods Comput. Sci., 2019)

Dynamic Complexity of Reachability: How Many Changes Can We Handle? - Samir Datta; Pankaj Kumar; Anish Mukherjee 001; Anuj Tawari; Nils Vortmeier; Thomas Zeume (ICALP, 2020)

Depth-First Search in Directed Graphs, Revisited. - Eric Allender; Archit Chauhan; Samir Datta (Electron. Colloquium Comput. Complex., 2020)

Randomized and Symmetric Catalytic Computation. - Samir Datta; Chetan Gupta 002; Rahul Jain 015; Vimal Raj Sharma; Raghunath Tewari (Electron. Colloquium Comput. Complex., 2020)

Dynamic Complexity of Expansion. - Samir Datta; Anuj Tawari; Yadu Vasudev (CSR, 2021)

Reachability and Matching in Single Crossing Minor Free Graphs. - Samir Datta; Chetan Gupta 002; Rahul Jain 015; Anish Mukherjee 001; Vimal Raj Sharma; Raghunath Tewari (FSTTCS, 2021)

Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles. - Samir Datta; Kishlaya Jaiswal (MFCS, 2021)

Dynamic Meta-Theorems for Distance and Matching. - Samir Datta; Chetan Gupta 002; Rahul Jain 015; Anish Mukherjee 001; Vimal Raj Sharma; Raghunath Tewari (ICALP, 2022)

Depth-first search in directed planar graphs, revisited. - Eric Allender; Archit Chauhan; Samir Datta (Acta Informatica, 2022)

On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs. - Eric Allender; Nikhil Balaji; Samir Datta; Rameshwar Pratap (Electron. Colloquium Comput. Complex., 2022)

Evaluating Monotone Circuits on Surfaces. - Samir Datta; Chetan Gupta 002 (Electron. Colloquium Comput. Complex., 2022)

Dynamic Planar Embedding Is in DynFO. - Samir Datta; Asif Khan 009; Anish Mukherjee 001 (MFCS, 2023)

USSR is in P/poly. - Nikhil Balaji; Samir Datta (Electron. Colloquium Comput. Complex., 2023)

The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. - Vikraman Arvind; Samir Datta; Asif Khan 009; Shivdutt Sharma; Yadu Vasudev; Shankar Ram Vasudevan (FSTTCS, 2024)

The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. - Archit Chauhan; Samir Datta; Chetan Gupta 002; Vimal Raj Sharma (MFCS, 2024)

Query Maintenance Under Batch Changes with Small-Depth Circuits. - Samir Datta; Asif Khan 009; Anish Mukherjee 001; Felix Tschirbs; Nils Vortmeier; Thomas Zeume (MFCS, 2024)

Revisiting Tree canonization using polynomials. - Vikraman Arvind; Samir Datta; Salman Faris; Asif Khan 009 (SOSA, 2025)

A parallel algorithm for the odd two-face shortest k-disjoint path problem. - Srijan Chakraborty; Samir Datta (CoRR, 2025)

Parallel Complexity of Depth-First-Search and Maximal path. - Archit Chauhan; Samir Datta; M. Praveen (CoRR, 2025)