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.
Countries citing papers authored by Robert E. Tarjan
Since
Specialization
Citations
This map shows the geographic impact of Robert E. Tarjan'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 Robert E. Tarjan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert E. Tarjan more than expected).
Fields of papers citing papers by Robert E. Tarjan
This network shows the impact of papers produced by Robert E. Tarjan. 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 Robert E. Tarjan. The network helps show where Robert E. Tarjan may publish in the future.
Co-authorship network of co-authors of Robert E. Tarjan
This figure shows the co-authorship network connecting the top 25 collaborators of Robert E. Tarjan.
A scholar is included among the top collaborators of Robert E. Tarjan 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 Robert E. Tarjan. Robert E. Tarjan 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.
Brodal, Gerth Stølting, et al.. (2024). Strict Fibonacci Heaps. ACM Transactions on Algorithms. 21(2). 1–18.
Cole, Richard, Philip N. Klein, & Robert E. Tarjan. (1994). A linear-work parallel algorithm for finding minimum spanning trees.. 11–15.17 indexed citations
11.
Driscoll, James R., Daniel D. Sleator, & Robert E. Tarjan. (1991). Fully persistent lists with catenation. Symposium on Discrete Algorithms. 89–99.6 indexed citations
Tarjan, Robert E. & Uzi Vishkin. (1984). Finding Biconnected Components and Computing Tree Functions in Logarithmic Parallel Time (Extended Summary). 12–20.25 indexed citations
16.
Sleator, Daniel D. & Robert E. Tarjan. (1983). A data structure for dynamic trees. Journal of Computer and System Sciences. 26(3). 362–391.550 indexed citations breakdown →
17.
Even, Shimon & Robert E. Tarjan. (1976). Computing an st-numbering. Theoretical Computer Science. 2(3). 339–344.127 indexed citations
18.
Winter, Michael, et al.. (1971). The effect of 25-hydroxycholecalciferol on the bone of vitamin D deficient rats.. Nutrition reports international. 4(3). 119–126.1 indexed citations
19.
Hopcroft, John E. & Robert E. Tarjan. (1971). Planarity testing in V log V steps: extended abstract. IFIP Congress. 85–90.10 indexed citations
20.
Tarjan, Robert E.. (1958). The problem of carotene metabolism.. Voprosy Pitaniya. 17(4). 3–8.1 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.