Samir Datta

ORCID

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 42

Top Venues

CoRR

MFCS

Electron. Colloquium Comput. Complex.

ICALP

Publications

Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume
Query maintenance under batch changes with small-depth circuits. CoRR (2024)
Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. MFCS (2024)
Archit Chauhan, Samir Datta, Chetan Gupta, Vimal Raj Sharma
The Even-Path Problem in Directed Single-Crossing-Minor-Free Graphs. CoRR (2024)
Samir Datta, Asif Khan, Anish Mukherjee, Felix Tschirbs, Nils Vortmeier, Thomas Zeume
Query Maintenance Under Batch Changes with Small-Depth Circuits. MFCS (2024)
Nikhil Balaji, Samir Datta
USSR is in P/poly. SOSA (2024)
Nikhil Balaji, Samir Datta
USSR is in P/poly. CoRR (2023)
Samir Datta, Asif Khan, Anish Mukherjee
Dynamic Planar Embedding is in DynFO. CoRR (2023)
Nikhil Balaji, Samir Datta
USSR is in P/poly. Electron. Colloquium Comput. Complex. (2023)
Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. CoRR (2023)
Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap
On the complexity of algebraic numbers, and the bit-complexity of straight-line programs. Comput. 12 (2) (2023)
Samir Datta, Asif Khan, Anish Mukherjee
Dynamic Planar Embedding Is in DynFO. MFCS (2023)
Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan
Dynamic Complexity of Group Problems. CoRR (2022)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Dynamic Meta-Theorems for Distance and Matching. ICALP (2022)
Eric Allender, Archit Chauhan, Samir Datta
Depth-first search in directed planar graphs, revisited. Acta Informatica 59 (4) (2022)
Samir Datta, Chetan Gupta
Evaluating Monotone Circuits on Surfaces. Electron. Colloquium Comput. Complex. (2022)
Eric Allender, Nikhil Balaji, Samir Datta, Rameshwar Pratap
On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs. Electron. Colloquium Comput. Complex. (2022)
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
Planar Graph Isomorphism Is in Log-Space. ACM Trans. Comput. Theory 14 (2) (2022)
Samir Datta, Kishlaya Jaiswal
Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles. CoRR (2021)
Eric Allender, Archit Chauhan, Samir Datta
Depth-First Search in Directed Planar Graphs, Revisited. MFCS (2021)
Samir Datta, Kishlaya Jaiswal
Parallel Polynomial Permanent Mod Powers of 2 and Shortest Disjoint Cycles. MFCS (2021)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Reachability and Matching in Single Crossing Minor Free Graphs. CoRR (2021)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Reachability and Matching in Single Crossing Minor Free Graphs. FSTTCS (2021)
Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari
Dynamic Meta-theorems for Distance and Matching. CoRR (2021)
Samir Datta, Anuj Tawari, Yadu Vasudev
Dynamic Complexity of Expansion. CSR (2021)
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume
Dynamic complexity of Reachability: How many changes can we handle? CoRR (2020)
Samir Datta, Pankaj Kumar, Anish Mukherjee, Anuj Tawari, Nils Vortmeier, Thomas Zeume
Dynamic Complexity of Reachability: How Many Changes Can We Handle? ICALP (2020)
Eric Allender, Archit Chauhan, Samir Datta
Depth-First Search in Directed Graphs, Revisited. Electron. Colloquium Comput. Complex. 27 (2020)
Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
Randomized and Symmetric Catalytic Computation. CSR (2020)
Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
Randomized and Symmetric Catalytic Computation. Electron. Colloquium Comput. Complex. 27 (2020)
Samir Datta, Anuj Tawari, Yadu Vasudev
Dynamic Complexity of Expansion. CoRR (2020)
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
A Strategy for Dynamic Programs: Start over and Muddle through. Log. Methods Comput. Sci. 15 (2) (2019)
Eric Allender, Archit Chauhan, Samir Datta, Anish Mukherjee
Planarity, Exclusivity, and Unambiguity. Electron. Colloquium Comput. Complex. 26 (2019)
Samir Datta, Raghav Kulkarni, Ashish Kumar, Anish Mukherjee
Planar Maximum Matching: Towards a Parallel Algorithm. ISAAC (2018)
Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume
Reachability and Distances under Multiple Changes. ICALP (2018)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability Is in DynFO. J. ACM 65 (5) (2018)
Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume
Reachability and Distances under Multiple Changes. CoRR (2018)
Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee
Shortest k-Disjoint Paths via Determinants. FSTTCS (2018)
Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee
Shortest k-Disjoint Paths via Determinants. CoRR (2018)
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
A Strategy for Dynamic Programs: Start over and Muddle Through. ICALP (2017)
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier, Thomas Zeume
A Strategy for Dynamic Programs: Start over and Muddle through. CoRR (2017)
Samir Datta, Raghav Kulkarni, Anish Mukherjee
Space-Efficient Approximation Scheme for Maximum Matching in Sparse Graphs. MFCS (2016)
Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder
Graph Properties in Node-Query Setting: Effect of Breaking Symmetry. MFCS (2016)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability is in DynFO. CoRR (2015)
Nikhil Balaji, Samir Datta
Bounded Treewidth and Space-Efficient Linear Algebra. TAMC (2015)
Nikhil Balaji, Samir Datta, Venkatesh Ganesan
Counting Euler Tours in Undirected Bounded Treewidth Graphs. FSTTCS (2015)
Nikhil Balaji, Samir Datta, Venkatesh Ganesan
Counting Euler Tours in Undirected Bounded Treewidth Graphs. CoRR (2015)
Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas Schwentick, Thomas Zeume
Reachability is in DynFO. ICALP (2) (2015)
Nikhil Balaji, Samir Datta, Raghav Kulkarni, Supartha Podder
Graph properties in node-query setting: effect of breaking symmetry. CoRR (2015)
Eric Allender, Nikhil Balaji, Samir Datta
Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. MFCS (2) (2014)
Samir Datta, William Hesse, Raghav Kulkarni
Dynamic Complexity of Directed Reachability and Other Problems. ICALP (1) (2014)
Samir Datta, Raghav Kulkarni
Space Complexity of Optimization Problems in Planar Graphs. TAMC (2014)
Nikhil Balaji, Samir Datta
Collapsing Exact Arithmetic Hierarchies. WALCOM (2014)
Nikhil Balaji, Samir Datta
Bounded Treewidth and Space-Efficient Linear Algebra. CoRR (2014)
Eric Allender, Nikhil Balaji, Samir Datta
Low-depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. Electron. Colloquium Comput. Complex. 20 (2013)
Nikhil Balaji, Samir Datta
Tree-width and Logspace: Determinants and Counting Euler Tours. CoRR (2013)
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
Log-Space Algorithms for Paths and Matchings in k-Trees. Theory Comput. Syst. 53 (4) (2013)
Nikhil Balaji, Samir Datta
Collapsing Exact Arithmetic Hierarchies. Electron. Colloquium Comput. Complex. 20 (2013)
Samir Datta, Raghav Kulkarni
Space complexity: what makes planar graphs special? Bull. EATCS 109 (2013)
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying proofs in constant depth. ACM Trans. Comput. Theory 5 (1) (2013)
Samir Datta, Rameshwar Pratap
Computing Bits of Algebraic Numbers. TAMC (2012)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. 78 (3) (2012)
Samir Datta, Arjun Gopalan, Raghav Kulkarni, Raghunath Tewari
Improved Bounds for Bipartite Matching on Surfaces. STACS (2012)
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying Proofs in Constant Depth. Electron. Colloquium Comput. Complex. 19 (2012)
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
and L. Theor. Comput. Sci. 417 (2012)
Samir Datta, Gautam Prakriya
Planarity Testing Revisited. TAMC (2011)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. Variyam Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. STACS (2011)
Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying Proofs in Constant Depth. MFCS (2011)
Samir Datta, Gautam Prakriya
Planarity Testing Revisited. Electron. Colloquium Comput. Complex. 18 (2011)
Samir Datta, Nagarajan Krishnamurthy
Some Tractable Win-Lose Games. TAMC (2011)
Samir Datta, Rameshwar Pratap
Computing Bits of Algebraic Numbers CoRR (2011)
Samir Datta, Gautam Prakriya
Planarity Testing Revisited CoRR (2011)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs. Electron. Colloquium Comput. Complex. 17 (2010)
Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
Planarity, Determinants, Permanents, and (Unique) Matchings. ACM Trans. Comput. Theory 1 (3) (2010)
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
and L. Electron. Colloquium Comput. Complex. 17 (2010)
Samir Datta, Nagarajan Krishnamurthy
Some Tractable Win-Lose Games CoRR (2010)
Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
-free graphs is in Log-space. Electron. Colloquium Comput. Complex. 17 (2010)
Samir Datta, Raghav Kulkarni, Sambuddha Roy
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. Theory Comput. Syst. 47 (3) (2010)
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
and L. MFCS (2010)
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
Log-space Algorithms for Paths and Matchings in k-trees. STACS (2010)
Samir Datta, Raghav Kulkarni, Raghunath Tewari
Perfect Matching in Bipartite Planar Graphs is in UL. Electron. Colloquium Comput. Complex. 17 (2010)
Samir Datta, Raghav Kulkarni, Raghunath Tewari, N. V. Vinodchandran
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs CoRR (2010)
Samir Datta, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. FSTTCS (2009)
Bireswar Das, Samir Datta, Prajakta Nimbhorkar
Log-space Algorithms for Paths and Matchings in k-trees CoRR (2009)
Fabian Wagner, Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf
Planar Graph Isomorphism is in Log-space. Electron. Colloquium Comput. Complex. 16 (2009)
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Planar and Grid Graph Reachability Problems. Theory Comput. Syst. 45 (4) (2009)
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
Planar Graph Isomorphism is in Log-Space. Computational Complexity Conference (2009)
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
Planar Graph Isomorphism is in Log-Space. Algebraic Methods in Computational Complexity (2009)
Samir Datta, Raghav Kulkarni, Sambuddha Roy
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs. STACS (2008)
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar, Thomas Thierauf, Fabian Wagner
A Log-space Algorithm for Canonization of Planar Graphs CoRR (2008)
Samir Datta, Raghav Kulkarni, Sambuddha Roy
Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs CoRR (2008)
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar
3-connected Planar Graph Isomorphism is in Log-space CoRR (2008)
Samir Datta, Nutan Limaye, Prajakta Nimbhorkar
3-connected Planar Graph Isomorphism is in Log-space. FSTTCS (2008)
Samir Datta, Raghav Kulkarni, Nutan Limaye, Meena Mahajan
Planarity, Determinants, Permanents, and (Unique) Matchings. CSR (2007)
Tanmoy Chakraborty, Samir Datta
One-input-face MPCVP is Hard for L, but in LogDCFL. Electron. Colloquium Comput. Complex. 13 (130) (2006)
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Grid Graph Reachability Problems. Computational Complexity Conference (2006)
Tanmoy Chakraborty, Samir Datta
One-Input-Face MPCVP Is Hard for L, But in LogDCFL. FSTTCS (2006)
Rohit Naik, Subir K. Biswas, Samir Datta
Distributed Sleep-Scheduling Protocols for Energy Conservation in Wireless Networks. HICSS (2005)
Eric Allender, Samir Datta, Sambuddha Roy
The Directed Planar Reachability Problem. FSTTCS (2005)
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
Grid Graph Reachability Problems Electron. Colloquium Comput. Complex. (149) (2005)
Samir Datta, Ivan Seskar, Mustafa Demirhan, Siun-Chuon Mau, Dipankar Raychaudhuri
Ad-Hoc Extensions to the 802.15.3 MAC Protocol. WOWMOM (2005)

Samir Datta.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Samir Datta