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.
OpenMP to GPGPU
2009281 citationsRudolf Eigenmann et al.Purdue e-Pubs (Purdue University System)profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Rudolf Eigenmann
Since
Specialization
Citations
This map shows the geographic impact of Rudolf Eigenmann'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 Rudolf Eigenmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Rudolf Eigenmann more than expected).
Fields of papers citing papers by Rudolf Eigenmann
This network shows the impact of papers produced by Rudolf Eigenmann. 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 Rudolf Eigenmann. The network helps show where Rudolf Eigenmann may publish in the future.
Co-authorship network of co-authors of Rudolf Eigenmann
This figure shows the co-authorship network connecting the top 25 collaborators of Rudolf Eigenmann.
A scholar is included among the top collaborators of Rudolf Eigenmann 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 Rudolf Eigenmann. Rudolf Eigenmann is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Kim, Jong‐Kook, Howard Jay Siegel, Anthony A. Maciejewski, & Rudolf Eigenmann. (2004). Resource management in heterogeneous computing systems: Continuously running applications, tasks with priorities and deadlines, and power constrained mobile devices. Purdue e-Pubs (Purdue University System).2 indexed citations
9.
Eigenmann, Rudolf, et al.. (2004). Decentralized and Hierarchical Discovery of Software Applications in the iShare Internet Sharing System.. 124–130.6 indexed citations
10.
Lee, Sang‐Ik, Tyler Johnson, & Rudolf Eigenmann. (2003). Cetus - An Extensible Compiler Infrastructure for Source-to-Source Transformation.3 indexed citations
11.
Eigenmann, Rudolf & Martin Rinard. (2003). Proceedings of the ninth ACM SIGPLAN symposium on Principles and practice of parallel programming.1 indexed citations
12.
Eigenmann, Rudolf. (2001). Performance evaluation and benchmarking with realistic applications. MIT Press eBooks.14 indexed citations
13.
Kim, Seon Wook, et al.. (2001). Reference idempotency analysis. Infoscience (Ecole Polytechnique Fédérale de Lausanne). 2–11.17 indexed citations
14.
Armstrong, Brian & Rudolf Eigenmann. (2001). A methodology for scientific benchmarking with large-scale applications. MIT Press eBooks. 109–127.5 indexed citations
15.
Park, In‐Sung, et al.. (2000). Interactive and Modular Optimization with InterPol.. Parallel and Distributed Processing Techniques and Applications.2 indexed citations
Dietz, H. G., Rudolf Eigenmann, J.A.B. Fortes, & Susanne E. Hambrusch. (1997). Proceedings of the 1997 International Conference on Parallel Processing, August 11-15, 1997.1 indexed citations
18.
Eigenmann, Rudolf, et al.. (1994). Polaris: The Next Generation in Parallelizing Compilers.35 indexed citations
Eigenmann, Rudolf & William Blume. (1991). An Effectiveness Study of Parallelizing Compiler Techniques.. Proceedings of the International Conference on Parallel Processing. 17–25.24 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.