49.Revisiting Tree canonization using polynomials.
Vikraman Arvind, Samir Datta, Salman Faris, Asif Khan — SOSA — 2025
48.Query Maintenance Under Batch Changes with Small-Depth Circuits.
Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume — MFCS — 2024
47.The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs.
Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma — MFCS — 2024
46.The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem.
Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan — FSTTCS — 2024
43.Dynamic Meta-Theorems for Distance and Matching.
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari — ICALP — 2022
42.Depth-First Search in Directed Planar Graphs, Revisited.
Eric Allender, Archit Chauhan, Samir Datta — MFCS — 2021
40.Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles.
Samir Datta, Kishlaya Jaiswal — MFCS — 2021
39.Reachability and Matching in Single Crossing Minor Free Graphs.
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari — FSTTCS — 2021
38.Dynamic Complexity of Reachability: How Many Changes Can We Handle?
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume — ICALP — 2020
37.Randomized and Symmetric Catalytic Computation.
Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari — CSR — 2020
36.Planar Maximum Matching: Towards a Parallel Algorithm.
Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee — ISAAC — 2018
35.Reachability and Distances under Multiple Changes.
Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume — ICALP — 2018
34.Shortest k-Disjoint Paths via Determinants.
Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee — FSTTCS — 2018
33.A Strategy for Dynamic Programs: Start over and Muddle Through.
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume — ICALP — 2017
32.Graph Properties in Node-Query Setting: Effect of Breaking Symmetry.
Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder — MFCS — 2016
31.Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs.
Samir Datta, Raghav Kulkarni, Anish Mukherjee — MFCS — 2016
30.Bounded Treewidth and Space-Efficient Linear Algebra.
Nikhil Balaji, Samir Datta — TAMC — 2015
29.Counting Euler Tours in Undirected Bounded Treewidth Graphs.
Nikhil Balaji, Samir Datta, Venkatesh Ganesan — FSTTCS — 2015
28.Reachability is in DynFO.
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume — ICALP (2) — 2015
26.Dynamic Complexity of Directed Reachability and Other Problems.
Samir Datta, William Hesse, Raghav Kulkarni — ICALP (1) — 2014
25.Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs.
Eric Allender, Nikhil Balaji, Samir Datta — MFCS (2) — 2014
24.Space Complexity of Optimization Problems in Planar Graphs.
Samir Datta, Raghav Kulkarni — TAMC — 2014
22.Improved Bounds for Bipartite Matching on Surfaces.
Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari — STACS — 2012
19.Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran — STACS — 2011
18.Verifying Proofs in Constant Depth.
Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer — MFCS — 2011
17.Counting Classes and the Fine Structure between NC1 and L.
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer — MFCS — 2010
16.Log-space Algorithms for Paths and Matchings in k-trees.
Bireswar Das, Samir Datta, Prajakta Nimbhorkar — STACS — 2010
15.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
14.Planar Graph Isomorphism is in Log-Space.
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner — CCC — 2009
13.Planar Graph Isomorphism is in Log-Space.
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner — Algebraic Methods in Computational Complexity — 2009
12.3-connected Planar Graph Isomorphism is in Log-space.
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar — FSTTCS — 2008
11.Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs.
Samir Datta, Raghav Kulkarni, Sambuddha Roy — STACS — 2008
10.Planarity, Determinants, Permanents, and (Unique) Matchings.
Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan — CSR — 2007
9.Grid Graph Reachability Problems.
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy — CCC — 2006
8.One-Input-Face MPCVP Is Hard for L, But in LogDCFL.
Tanmoy Chakraborty, Samir Datta — FSTTCS — 2006
7.Ad-Hoc Extensions to the 802.15.3 MAC Protocol.
Samir Datta, Ivan Seskar, Mustafa Demirhan, Siun-Chuon Mau, Dipankar Raychaudhuri — WOWMOM — 2005
6.Distributed Sleep-Scheduling Protocols for Energy Conservation in Wireless Networks.
Rohit Naik, Subir K. Biswas, Samir Datta — HICSS — 2005
5.The Directed Planar Reachability Problem.
Eric Allender, Samir Datta, Sambuddha Roy — FSTTCS — 2005
3.Reducing overhearing energy in 802.11 networks by low-power interface idling.
Subir Kumar Biswas, Samir Datta — IPCCC — 2004
2.Bounded Depth Arithmetic Circuits: Counting and Closure.
Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh — ICALP — 1999
1.On TC0, AC0, and Arithmetic Circuits.
Manindra Agrawal, Eric Allender, Samir Datta — CCC — 1997