Samir Datta

Cited by

	All	Since 2019
Citations	1015	277
h-index	19	9
i10-index	28	9

199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320243 10 9 9 31 27 14 24 47 26 53 56 53 45 39 74 56 53 41 47 55 38 53 38 59 34

Public access

View all

11 articles

1 article

available

not available

Based on funding mandates

Co-authors

Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
Raghav KulkarniCentre for Quantum Technologies, SingaporeVerified email at cs.uchicago.edu
Anish MukherjeeAssistant Professor, University of LiverpoolVerified email at liverpool.ac.uk
Prajakta NimbhorkarChennai Mathematical InstituteVerified email at cmi.ac.in
Nutan LimayeAssociate Professor, Computer Science, IT University of Copenhagen, DenmarkVerified email at itu.dk
Subir BiswasProfessor of Electrical and Computer Engineering, Michigan State UniversityVerified email at egr.msu.edu
Nikhil BalajiIIT DelhiVerified email at cmi.ac.in
Raghunath TewariAssociate Professor, Indian Institute of Technology, KanpurVerified email at cse.iitk.ac.in
Meena MahajanThe Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, IndiaVerified email at imsc.res.in
Tanmoy ChakrabortyUniversity of Pennsylvania, Harvard University, FacebookVerified email at seas.upenn.edu
Sambuddha RoyUnaffiliated - Deep Learning Consultant/PractitionerVerified email at in.ibm.com
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerified email at thi.uni-hannover.de
Nils VortmeierRuhr University BochumVerified email at rub.de
Manindra AgrawalProfessor of Computer Science, IIT KanpurVerified email at iitk.ac.in
Sudipta SenguptaVice President & Distinguished Scientist, Amazon AWSVerified email at amazon.com
Thomas SchwentickProfessor of Computer Science, TU Dortmund UniversityVerified email at udo.edu
Rahul JainUniversität SiegenVerified email at uni-siegen.de
Vimal Raj SharmaChennai Mathematical InstituteVerified email at cmi.ac.in
Chetan GuptaAssistant Professor, IIT RoorkeeVerified email at aalto.fi
Olaf BeyersdorffProfessor of Theoretical Computer Science, Friedrich Schiller University Jena, GermanyVerified email at uni-jena.de

Samir Datta

Professor of Computer Science, Chennai Mathematical Institute

Verified email at cmi.ac.in - Homepage

Computational Complexity Theory Graph Algorithms Dynamic Complexity


Title Sort by citations Sort by year Sort by 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	107	2009
On TC0, AC0, and arithmetic circuits M Agrawal, E Allender, S Datta Journal of Computer and System Sciences 60 (2), 395-421, 2000	82	2000
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	68	2001
Planar and grid graph reachability problems E Allender, DA Mix Barrington, T Chakraborty, S Datta, S Roy Theory of Computing Systems 45 (4), 675-723, 2009	67	2009
Deterministically isolating a perfect matching in bipartite planar graphs S Datta, R Kulkarni, S Roy Theory of Computing Systems, 2010	55	2010
Reachability is in DynFO S Datta, R Kulkarni, A Mukherjee, T Schwentick, T Zeume Journal of the ACM (JACM) 65 (5), 1-24, 2018	48	2018
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	43	2004
The directed planar reachability problem E Allender, S Datta, S Roy FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005	38	2005
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	35	2010
Bounded depth arithmetic circuits: Counting and closure E Allender, S Datta, A Ambainis, DA Mix Barrington, H LêThanh Automata, Languages and Programming: 26th International Colloquium, ICALP’99 …, 1999	30	1999
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	29	2009
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	28	2006
3-connected planar graph isomorphism is in log-space S Datta, N Limaye, P Nimbhorkar arXiv preprint arXiv:0806.1041, 2008	26	2008
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	25	2010
Log-space Algorithms for Paths and Matchings in k-trees B Das, S Datta, P Nimbhorkar Theory of Computing Systems, 2013, 2009	25*	2009
Improved bounds for bipartite matching on surfaces S Datta, A Gopalan, R Kulkarni, R Tewari 29th International Symposium on Theoretical Aspects of Computer Science …, 2012	23*	2012
One-input-face MPCVP is hard for L, but in LogDCFL T Chakraborty, S Datta FSTTCS 2006: Foundations of Software Technology and Theoretical Computer …, 2006	21	2006
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	21	2005
A strategy for dynamic programs: Start over and muddle through S Datta, A Mukherjee, T Schwentick, N Vortmeier, T Zeume Logical Methods in Computer Science 15, 2019	19	2019
Low-depth uniform threshold circuits and the bit-complexity of straight line programs E Allender, N Balaji, S Datta Mathematical Foundations of Computer Science 2014: 39th International …, 2014	19	2014

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors