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.
Locating features in source code
2003406 citationsThomas Eisenbarth, Rainer Koschke et al.profile →
Author Peers
Peers are selected by citation overlap in the author's most active subfields.
citations ·
hero ref
Countries citing papers authored by Thomas Eisenbarth
Since
Specialization
Citations
This map shows the geographic impact of Thomas Eisenbarth'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 Thomas Eisenbarth with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Thomas Eisenbarth more than expected).
Fields of papers citing papers by Thomas Eisenbarth
This network shows the impact of papers produced by Thomas Eisenbarth. 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 Thomas Eisenbarth. The network helps show where Thomas Eisenbarth may publish in the future.
Co-authorship network of co-authors of Thomas Eisenbarth
This figure shows the co-authorship network connecting the top 25 collaborators of Thomas Eisenbarth.
A scholar is included among the top collaborators of Thomas Eisenbarth 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 Thomas Eisenbarth. Thomas Eisenbarth is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Rohde, Sebastian, Thomas Eisenbarth, Erik Dahmen, Johannes Buchmann, & Christof Paar. (2014). Efficient Hash-Based Signatures on Embedded Devices.4 indexed citations
Balasch, Josep, Barış Ege, Thomas Eisenbarth, et al.. (2012). Compact Implementation and Performance Evaluation of Hash Functions in ATtiny Devices. Lecture notes in computer science. 2012. 158–172.2 indexed citations
17.
Bogdanov, Andrey, Thomas Eisenbarth, Andy Rupp, & Christopher Wolf. (2008). Time-Area Optimized Public-Key Engines: MQ -Cryptosystems as Replacement for Elliptic Curves?. Lecture notes in computer science. 2008. 349–61.19 indexed citations
18.
Gierlichs, Benedikt, Lejla Batina, Christophe Clavier, et al.. (2008). Susceptibility of eSTREAM Candidates towards Side Channel Analysis.20 indexed citations
19.
Bogdanov, Andrey, Thomas Eisenbarth, & Andy Rupp. (2007). A Hardware-Assisted Realtime Attack on A5/2 without Precomputations. Lecture notes in computer science. 4727. 394–412.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.