Samir Datta
Samir Datta
Professor of Computer Science, Chennai Mathematical Institute
Verified email at cmi.ac.in - Homepage
Title
Cited by
Cited by
Year
Planar graph isomorphism is in log-space
S Datta, N Limaye, P Nimbhorkar, T Thierauf, F Wagner
Computational Complexity, 2009. CCC'09. 24th Annual IEEE Conference on, 203-214, 2009
862009
On TC0, AC0, and arithmetic circuits
M Agrawal, E Allender, S Datta
Journal of Computer and System Sciences 60 (2), 395-421, 2000
752000
Efficient channel reservation for backup paths in optical mesh networks
S Datta, S Sengupta, S Biswas, S Datta
Global Telecommunications Conference, 2001. GLOBECOM'01. IEEE 4, 2104-2108 …, 2001
692001
Planar and grid graph reachability problems
E Allender, DAM Barrington, T Chakraborty, S Datta, S Roy
Theory of Computing Systems 45 (4), 675-723, 2009
582009
Deterministically isolating a perfect matching in bipartite planar graphs
S Datta, R Kulkarni, S Roy
Theory of Computing Systems, 2010
452010
Reducing overhearing energy in 802.11 networks by low-power interface idling
S Biswas, S Datta
IEEE International Conference on Performance, Computing, and Communications …, 2004
402004
The directed planar reachability problem
E Allender, S Datta, S Roy
International Conference on Foundations of Software Technology and …, 2005
362005
Planarity, determinants, permanents, and (unique) matchings
S Datta, R Kulkarni, N Limaye, M Mahajan
ACM Transactions on Computation Theory (TOCT) 1 (3), 1-20, 2010
332010
Reachability is in DynFO
S Datta, R Kulkarni, A Mukherjee, T Schwentick, T Zeume
Journal of the ACM (JACM) 65 (5), 1-24, 2018
312018
Bounded depth arithmetic circuits: Counting and closure
E Allender, S Datta, A Ambainis, DAM Barrington, H LêThanh
International Colloquium on Automata, Languages, and Programming, 149-158, 1999
281999
3-connected planar graph isomorphism is in log-space
S Datta, N Limaye, P Nimbhorkar
arXiv preprint arXiv:0806.1041, 2008
262008
Grid graph reachability problems
E Allender, T Chakraborty, DAM Barrington, S Datta, S Roy
21st Annual IEEE Conference on Computational Complexity (CCC'06), 15 pp.-313, 2006
262006
Log-space Algorithms for Paths and Matchings in k-trees
B Das, S Datta, P Nimbhorkar
Theory of Computing Systems, 2013, 2009
24*2009
Graph Isomorphism for K3, 3-free and K5-free graphs is in Log-space
S Datta, P Nimbhorkar, T Thierauf, F Wagner
IARCS Annual Conf. on Found. of Software Tech. and Theor. Comp. Sc (FSTTCS …, 2009
232009
Improved bounds for bipartite matching on surfaces
S Datta, A Gopalan, R Kulkarni, R Tewari
STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) 14, 254-265, 2012
21*2012
One-input-face MPCVP is hard for L, but in LogDCFL
T Chakraborty, S Datta
International Conference on Foundations of Software Technology and …, 2006
212006
Space complexity of perfect matching in bounded genus bipartite graphs
S Datta, R Kulkarni, R Tewari, NV Vinodchandran
Journal of Computer and System Sciences, 2012, 2010
202010
Ad-hoc Extensions to the 802.15. 3 MAC Protocol
S Datta, I Seskar, M Demirhan, SC Mau, D Raychaudhuri
Sixth IEEE International Symposium on a World of Wireless Mobile and …, 2005
192005
Distributed sleep-scheduling protocols for energy conservation in wireless networks
R Naik, S Biswas, S Datta
Proceedings of the 38th Annual Hawaii International Conference on System …, 2005
172005
Low-depth uniform threshold circuits and the bit-complexity of straight line programs
E Allender, N Balaji, S Datta
International Symposium on Mathematical Foundations of Computer Science, 13-24, 2014
132014
The system can't perform the operation now. Try again later.
Articles 1–20