Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
A Gene Expression Map of the Arabidopsis Root
2003989 citationsKenneth D. Birnbaum, Dennis Shasha et al.Scienceprofile →
Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
Citations per year, relative to Dennis Shasha Dennis Shasha (= 1×)
peers
Richard F. Helm
Countries citing papers authored by Dennis Shasha
Since
Specialization
Citations
This map shows the geographic impact of Dennis Shasha'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 Dennis Shasha with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Dennis Shasha more than expected).
This network shows the impact of papers produced by Dennis Shasha. 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 Dennis Shasha. The network helps show where Dennis Shasha may publish in the future.
Co-authorship network of co-authors of Dennis Shasha
This figure shows the co-authorship network connecting the top 25 collaborators of Dennis Shasha.
A scholar is included among the top collaborators of Dennis Shasha 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 Dennis Shasha. Dennis Shasha is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Bonnet, Philippe, Dennis Shasha, & Juliana Freire. (2012). Computational reproducibility: state-of-the-art, challenges, and database research opportunities. IT University Of Copenhagen (IT University of Copenhagen).8 indexed citations
Williams, Peter, Radu Sion, & Dennis Shasha. (2009). The Blind Stone Tablet: Outsourcing Durability to Untrusted Parties. Network and Distributed System Security Symposium.26 indexed citations
10.
Lakshmanan, Laks V. S., Raymond T. Ng, & Dennis Shasha. (2008). Proceedings of the 2008 ACM SIGMOD international conference on Management of data. International Conference on Management of Data.203 indexed citations
11.
Shasha, Dennis & Yunyue Zhu. (2004). High performance discovery in time series: Techniques and case studies. Springer eBooks.40 indexed citations
12.
Birnbaum, Kenneth D., Dennis Shasha, Jean Y. Wang, et al.. (2003). A Gene Expression Map of the Arabidopsis Root. Science. 302(5652). 1956–1960.989 indexed citations breakdown →
13.
Shasha, Dennis. (1999). Tuning time series queries in finance: Case studies and recommendations. IEEE Data(base) Engineering Bulletin. 22. 40–46.30 indexed citations
14.
Johnson, Theodore & Dennis Shasha. (1994). 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. Very Large Data Bases. 439–450.451 indexed citations
15.
Shasha, Dennis & Steve Rozen. (1992). Database Tuning. Very Large Data Bases. 313.7 indexed citations
16.
Rozen, Steve & Dennis Shasha. (1992). Rationale and design of BULK. 71–85.2 indexed citations
17.
Rozen, Steve & Dennis Shasha. (1991). A Framework for Automating Physical Database Design. Very Large Data Bases. 401–411.23 indexed citations
18.
Wang, Jason Tsong-Li & Dennis Shasha. (1990). Query Processing for Distance Metrics. Very Large Data Bases. 602–613.14 indexed citations
19.
Shasha, Dennis. (1985). What Good are Concurrent Search Structure Algorithms for databases Anyway. IEEE Data(base) Engineering Bulletin. 8. 84–90.15 indexed citations
20.
Shasha, Dennis. (1985). NetBook: a data model to support knowledge exploration. Very Large Data Bases. 418–425.7 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.