Samir Datta

1.5k total citations
73 papers, 848 citations indexed

About

Samir Datta is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Computer Vision and Pattern Recognition. According to data from OpenAlex, Samir Datta has authored 73 papers receiving a total of 848 indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 27 papers in Computer Networks and Communications and 20 papers in Computer Vision and Pattern Recognition. Recurrent topics in Samir Datta's work include Complexity and Algorithms in Graphs (23 papers), Advanced Graph Theory Research (21 papers) and Optimization and Search Problems (11 papers). Samir Datta is often cited by papers focused on Complexity and Algorithms in Graphs (23 papers), Advanced Graph Theory Research (21 papers) and Optimization and Search Problems (11 papers). Samir Datta collaborates with scholars based in India, United States and United Kingdom. Samir Datta's co-authors include Omar Farooq, Amir Asif, Ibrahim S. I. Abuhaiba, Ivan Stojmenović, Christopher Long, Subir Biswas, Eric Allender, Raghav Kulkarni, Sambuddha Roy and Manindra Agrawal and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Industry Applications and Pattern Recognition.

In The Last Decade

Samir Datta

71 papers receiving 759 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Samir Datta India 19 237 229 210 200 138 73 848
Paul M. Baggenstoss United States 14 237 1.0× 187 0.8× 42 0.2× 395 2.0× 22 0.2× 69 753
John Iacono United States 13 125 0.5× 144 0.6× 212 1.0× 226 1.1× 131 0.9× 74 623
Wen Gao China 16 299 1.3× 927 4.0× 82 0.4× 237 1.2× 36 0.3× 77 1.2k
K. Benkrid United Kingdom 12 93 0.4× 181 0.8× 57 0.3× 115 0.6× 55 0.4× 37 461
Anthony Zaknich Australia 12 84 0.4× 64 0.3× 39 0.2× 242 1.2× 113 0.8× 58 494
Jianhong Xiang China 14 47 0.2× 184 0.8× 98 0.5× 73 0.4× 42 0.3× 68 521
Minghai Qin United States 11 26 0.1× 293 1.3× 236 1.1× 216 1.1× 86 0.6× 42 709
Rui Fa United Kingdom 15 248 1.0× 44 0.2× 155 0.7× 75 0.4× 26 0.2× 63 769
Zhenquan Zhuang China 11 221 0.9× 245 1.1× 54 0.3× 94 0.5× 44 0.3× 41 549
A. Benkrid United Kingdom 12 69 0.3× 150 0.7× 38 0.2× 91 0.5× 39 0.3× 31 372

Countries citing papers authored by Samir Datta

Since Specialization
Citations

This map shows the geographic impact of Samir Datta's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Samir Datta with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Samir Datta more than expected).

Fields of papers citing papers by Samir Datta

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Samir Datta. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Samir Datta. The network helps show where Samir Datta may publish in the future.

Co-authorship network of co-authors of Samir Datta

This figure shows the co-authorship network connecting the top 25 collaborators of Samir Datta. A scholar is included among the top collaborators of Samir Datta based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Samir Datta. Samir Datta is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Allender, Eric, et al.. (2023). On the complexity of algebraic numbers, and the bit-complexity of straight-line programs. View. 12(2). 145–173. 1 indexed citations
2.
Datta, Samir, et al.. (2022). Planar Graph Isomorphism Is in Log-Space. IT University Of Copenhagen (IT University of Copenhagen). 14(2). 1–33.
3.
Allender, Eric, et al.. (2022). Depth-first search in directed planar graphs, revisited. Acta Informatica. 59(4). 289–319. 1 indexed citations
4.
Datta, Samir, et al.. (2019). A Strategy for Dynamic Programs: Start over and Muddle through. SHILAP Revista de lepidopterología. 2 indexed citations
5.
Datta, Samir, et al.. (2018). Reachability and Distances under Multiple Changes. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
6.
Allender, Eric, et al.. (2014). Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. View. 20. 177. 1 indexed citations
7.
Datta, Samir & Raghav Kulkarni. (2013). Space complexity: what makes planar graphs special?. Bulletin of the European Association for Theoretical Computer Science. 1(109). 35–53. 1 indexed citations
8.
Mulvaney, David, B. Woodward, Samir Datta, et al.. (2012). Development of m-health monitoring systems in India and Iraq. PubMed. 2012. 288–291. 11 indexed citations
9.
Harvey, Paul, B. Woodward, Samir Datta, & David Mulvaney. (2011). Data acquisition in a wireless diabetic and cardiac monitoring system. PubMed. 55. 3154–3157. 7 indexed citations
10.
Datta, Samir, et al.. (2011). Counting classes and the fine structure between NC1 and L. Theoretical Computer Science. 417. 36–49. 2 indexed citations
11.
Datta, Samir, et al.. (2011). Space complexity of perfect matching in bounded genus bipartite graphs. Journal of Computer and System Sciences. 78(3). 765–779. 7 indexed citations
12.
Datta, Samir, et al.. (2010). Graph Isomorphism for K {3, 3} -free and K 5 -free graphs is in Log-space.. Electronic colloquium on computational complexity. 17. 50. 4 indexed citations
13.
Datta, Samir, et al.. (2010). Perfect Matching in Bipartite Planar Graphs is in UL.. Electronic colloquium on computational complexity. 17. 201. 1 indexed citations
14.
Farooq, Omar, Samir Datta, & Jonathan Blackledge. (2008). Robust watermarking of audio with blind self-authentication. 35–39. 2 indexed citations
15.
Farooq, Omar, Samir Datta, & Jonathan Blackledge. (2008). Blind tamper detection in audio using chirp based robust watermarking. 4(4). 190–200. 8 indexed citations
16.
Allender, Eric, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, & Sambuddha Roy. (2006). Grid Graph Reachability Problems. View. 299–313. 4 indexed citations
17.
Farooq, Omar & Samir Datta. (2003). Wavelet-based denoising for robust feature extraction for speech recognition. Electronics Letters. 39(1). 163–165. 20 indexed citations
18.
Agrawal, Manindra, Eric Allender, Samir Datta, Heribert Vollmer, & Klaus W. Wagner. (2000). Characterizing Small Depth and Small Space Classes by Operators of Higher Type.. 2000. 3 indexed citations
19.
Agrawal, Manindra, Eric Allender, & Samir Datta. (2000). On TC0, AC0, and Arithmetic Circuits. Journal of Computer and System Sciences. 60(2). 395–421. 27 indexed citations
20.
Datta, Samir, et al.. (1995). Techniques to isolate dolphin whistles and other tonal sounds from background noise. 18(10). 189–193. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026