S. Seshadri

3.2k total citations
69 papers, 1.8k citations indexed

About

S. Seshadri is a scholar working on Computer Networks and Communications, Information Systems and Signal Processing. According to data from OpenAlex, S. Seshadri has authored 69 papers receiving a total of 1.8k indexed citations (citations by other indexed papers that have themselves been cited), including 63 papers in Computer Networks and Communications, 17 papers in Information Systems and 15 papers in Signal Processing. Recurrent topics in S. Seshadri's work include Distributed systems and fault tolerance (28 papers), Advanced Data Storage Technologies (25 papers) and Advanced Database Systems and Queries (23 papers). S. Seshadri is often cited by papers focused on Distributed systems and fault tolerance (28 papers), Advanced Data Storage Technologies (25 papers) and Advanced Database Systems and Queries (23 papers). S. Seshadri collaborates with scholars based in United States, India and Canada. S. Seshadri's co-authors include Jeffrey F. Naughton, S. Sudarshan, Peter J. Haas, Rajeev Rastogi, Prasan Roy, Minos Garofalakis, Donovan A. Schneider, Lynne Stokes, David J. DeWitt and Jayant R. Haritsa and has published in prestigious journals such as IEEE Journal on Selected Areas in Communications, IEEE Transactions on Knowledge and Data Engineering and IEEE Transactions on Parallel and Distributed Systems.

In The Last Decade

S. Seshadri

65 papers receiving 1.6k citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
S. Seshadri United States	20	1.5k	720	600	582	192	69	1.8k
Vladislav Shkapenyuk United States	16	1.3k 0.9×	682 0.9×	570 0.9×	571 1.0×	79 0.4×	27	1.6k
Jun Rao United States	17	1.2k 0.8×	509 0.7×	438 0.7×	639 1.1×	207 1.1×	25	1.4k
Marcin Żukowski Netherlands	16	1.3k 0.9×	515 0.7×	528 0.9×	563 1.0×	243 1.3×	34	1.5k
Berthold Reinwald United States	20	992 0.7×	487 0.7×	795 1.3×	660 1.1×	199 1.0×	65	1.6k
Michael B. Greenwald United States	16	978 0.7×	322 0.4×	718 1.2×	277 0.5×	212 1.1×	35	1.4k
Swarup Acharya United States	22	2.7k 1.8×	1.1k 1.5×	601 1.0×	356 0.6×	198 1.0×	34	3.0k
Viktor Leis Germany	25	1.9k 1.3×	654 0.9×	621 1.0×	781 1.3×	548 2.9×	82	2.3k
S. Bing Yao United States	18	1.5k 1.0×	861 1.2×	521 0.9×	338 0.6×	135 0.7×	49	1.7k
Barzan Mozafari United States	21	1.0k 0.7×	737 1.0×	671 1.1×	571 1.0×	72 0.4×	49	1.6k
Tom Price United States	7	1.8k 1.2×	1.1k 1.6×	737 1.2×	407 0.7×	155 0.8×	9	1.9k

Countries citing papers authored by S. Seshadri

Since Specialization

Citations

This map shows the geographic impact of S. Seshadri'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 S. Seshadri with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites S. Seshadri more than expected).

Fields of papers citing papers by S. Seshadri

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by S. Seshadri. 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 S. Seshadri. The network helps show where S. Seshadri may publish in the future.

Co-authorship network of co-authors of S. Seshadri

This figure shows the co-authorship network connecting the top 25 collaborators of S. Seshadri. A scholar is included among the top collaborators of S. Seshadri 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 S. Seshadri. S. Seshadri is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Martopullo, Ira, Sarah Baird, Mengjia Liang, et al.. (2024). Understanding progress and challenges in women's health and wellbeing in exemplar countries: a time-series study identifying positive outliers. The Lancet Global Health. 12(12). e2012–e2023. 2 indexed citations

Chen, Keke, S. Seshadri, & Liang‐Jie Zhang. (2019). Big data - BigData 2019 : 8th International Congress held as part of the Services Conference Federation, SCF 2019, San Diego, CA, USA, June 25-30, 2019, proceedings. CERN Document Server (European Organization for Nuclear Research). 11 indexed citations

Seshadri, S., et al.. (2018). Applying Data Mining Techniques For Store Layout of A Super Market. International Journal of Scientific Research in Computer Science Engineering and Information Technology. 4(2). 481–483.

Kim, Hyojun, et al.. (2014). Flash-Conscious Cache Population for Enterprise Database Workloads.. Very Large Data Bases. 45–56. 5 indexed citations

Seshadri, S., et al.. (2008). Enhancing storage system availability on multi-core architectures with recovery-conscious scheduling. File and Storage Technologies. 10. 1 indexed citations

Garofalakis, Minos, Aristides Gionis, Rajeev Rastogi, S. Seshadri, & Kyuseok Shim. (2003). DTD Inference from XML Documents: The XTRACT Approach.. IEEE Data(base) Engineering Bulletin. 26. 19–25. 10 indexed citations

Haritsa, Jayant R. & S. Seshadri. (2000). Real-time index concurrency control. IEEE Transactions on Knowledge and Data Engineering. 12(3). 429–447. 13 indexed citations

Rastogi, Rajeev, et al.. (1997). Logical and Physical Versioning in Main Memory Databases. Very Large Data Bases. 86–95. 19 indexed citations

Jagadish, H. V., et al.. (1997). Incremental Organization for Data Recording and Warehousing. Very Large Data Bases. 16–25. 71 indexed citations

10.

Seshadri, S., et al.. (1996). Clustering Techniques for Minimizing External Path Length. DSpace (IIT Bombay). 342–353. 25 indexed citations

11.

Haas, Peter J., Jeffrey F. Naughton, S. Seshadri, & Arun Swami. (1996). Selectivity and Cost Estimation for Joins Based on Random Sampling. Journal of Computer and System Sciences. 52(3). 550–569. 93 indexed citations

12.

Haritsa, Jayant R. & S. Seshadri. (1996). Index Concurrency Control in Firm Real-Time DBMS. NOT FOUND REPOSITORY (Indian Institute of Science Bangalore). 9 indexed citations

13.

Haas, Peter J., Jeffrey F. Naughton, S. Seshadri, & Lynne Stokes. (1995). Sampling-Based Estimation of the Number of Distinct Values of an Attribute. Very Large Data Bases. 311–322. 184 indexed citations

14.

Seshadri, S., et al.. (1995). On the Expected Size of Recursive Datalog Queries. Journal of Computer and System Sciences. 51(2). 137–148.

15.

Ray, Gautam, Jayant R. Haritsa, & S. Seshadri. (1995). Database Compression: A Performance Enhancement Tool.. 42(10). 0–9. 35 indexed citations

16.

Seshadri, S., et al.. (1994). The hcC-tree: An Efficient Index Structure for Object Oriented Databases. Very Large Data Bases. 203–213. 19 indexed citations

17.

Seshadri, S., Jayant R. Haritsa, & Shiby Thomas. (1994). Design Issues of Extensible Concurrency Control Mechanisms.. 0.

18.

Lipton, Richard J., Jeffrey F. Naughton, Donovan A. Schneider, & S. Seshadri. (1993). Efficient sampling strategies for relational database operations. Theoretical Computer Science. 116(1). 195–226. 61 indexed citations

19.

DeWitt, David J., Jeffrey F. Naughton, Donovan A. Schneider, & S. Seshadri. (1992). Practical Skew Handling in Parallel Joins. Minds at UW (University of Wisconsin). 27–40. 173 indexed citations

20.

Seshadri, S. & Jeffrey F. Naughton. (1991). On the expected size of recursive Datalog queries. 268–279. 6 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