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.
The worst-case execution-time problem—overview of methods and survey of tools
20081.1k citationsReinhard Wilhelm, Jakob Engblom et al.ACM Transactions on Embedded Computing Systemsprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
This map shows the geographic impact of Niklas Holsti'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 Niklas Holsti with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Niklas Holsti more than expected).
This network shows the impact of papers produced by Niklas Holsti. 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 Niklas Holsti. The network helps show where Niklas Holsti may publish in the future.
Co-authorship network of co-authors of Niklas Holsti
This figure shows the co-authorship network connecting the top 25 collaborators of Niklas Holsti.
A scholar is included among the top collaborators of Niklas Holsti 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 Niklas Holsti. Niklas Holsti 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.
Holsti, Niklas, et al.. (2014). Combining Bound-T and SWEET to Analyse Dynamic Control Flow in Machine-Code Programs.
2.
Holsti, Niklas, et al.. (2013). Time and Space Partitioning the EagleEye Reference Misson. 720. 22.6 indexed citations
Holsti, Niklas, Jan Gustafsson, Guillem Bernat, et al.. (2008). WCET TOOL CHALLENGE 2008: REPORT.5 indexed citations
5.
Mezzetti, Enrico, Niklas Holsti, A. Colin, Guillem Bernat, & Tullio Vardanega. (2008). Attacking the Sources of Unpredictability in the Instruction Cache Behavior. HAL (Le Centre pour la Communication Scientifique Directe).14 indexed citations
Wilhelm, Reinhard, Jakob Engblom, Andreas Ermedahl, et al.. (2008). The worst-case execution-time problem—overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems. 7(3). 1–53.1137 indexed citations breakdown →
Holsti, Niklas, et al.. (2000). USING A WORST-CASE EXECUTION TIME TOOL FOR REAL-TIME VERIFICATION OF THE DEBIE SOFTWARE.30 indexed citations
16.
Holsti, Niklas, et al.. (1998). Developing application frameworks for mission-critical software: Using space applications as an example..3 indexed citations
17.
Holsti, Niklas, et al.. (1998). Case Tool Evaluation. 422. 121.1 indexed citations
Mattila, K., et al.. (1985). Rapid outbursts in the water maser Cepheus A. 145(1). 192–200.6 indexed citations
20.
Vilhu, O., I. Tuominen, & Niklas Holsti. (1978). A Spectroscopic Study of Weak Helium Line Stars. 45. 124.
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.