Jens Knoop

2.2k total citations
47 papers, 840 citations indexed

About

Jens Knoop is a scholar working on Hardware and Architecture, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Jens Knoop has authored 47 papers receiving a total of 840 indexed citations (citations by other indexed papers that have themselves been cited), including 36 papers in Hardware and Architecture, 22 papers in Artificial Intelligence and 17 papers in Computer Networks and Communications. Recurrent topics in Jens Knoop's work include Parallel Computing and Optimization Techniques (29 papers), Logic, programming, and type systems (16 papers) and Real-Time Systems Scheduling (12 papers). Jens Knoop is often cited by papers focused on Parallel Computing and Optimization Techniques (29 papers), Logic, programming, and type systems (16 papers) and Real-Time Systems Scheduling (12 papers). Jens Knoop collaborates with scholars based in Austria, Germany and Sweden. Jens Knoop's co-authors include Bernhard Steffen, Oliver Rüthing, Jürgen Vollmer, Markus Schordan, Raimund Kirner, Laura Kovács, Peter Puschner, Benedikt Huber, Daniel Prokesch and Jingling Xue and has published in prestigious journals such as IEEE Transactions on Parallel and Distributed Systems, Theoretical Computer Science and ACM SIGPLAN Notices.

In The Last Decade

Jens Knoop

45 papers receiving 763 citations

Peers

Jens Knoop
Richard Johnson United States
David Chase United States
Patrick Meredith United States
Henry G. Baker United States
Fred Chow United States
Alan Mycroft United Kingdom
Richard Johnson United States
Jens Knoop
Citations per year, relative to Jens Knoop Jens Knoop (= 1×) peers Richard Johnson

Countries citing papers authored by Jens Knoop

Since Specialization
Citations

This map shows the geographic impact of Jens Knoop'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 Jens Knoop with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jens Knoop more than expected).

Fields of papers citing papers by Jens Knoop

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jens Knoop. 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 Jens Knoop. The network helps show where Jens Knoop may publish in the future.

Co-authorship network of co-authors of Jens Knoop

This figure shows the co-authorship network connecting the top 25 collaborators of Jens Knoop. A scholar is included among the top collaborators of Jens Knoop 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 Jens Knoop. Jens Knoop 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.
Knoop, Jens, et al.. (2016). Replacing conjectures by positive knowledge: Inferring proven precise worst-case execution time bounds using symbolic execution. Journal of Symbolic Computation. 80. 101–124. 1 indexed citations
2.
Bader, Markus, et al.. (2016). Austrian-Kangaroos 2011 Team Description Paper (TDP).
3.
Biere, Armin, et al.. (2013). The Auspicious Couple: Symbolic Execution and WCET Analysis. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 3 indexed citations
4.
Puschner, Peter, et al.. (2013). The T-CREST approach of compiler and WCET-analysis integration. 17. 1–8. 27 indexed citations
5.
Knoop, Jens, et al.. (2013). WCET squeezing. Chalmers Research (Chalmers University of Technology). 161–170. 19 indexed citations
6.
Knoop, Jens, et al.. (2011). An Evaluation of WCET Analysis using Symbolic Loop Bounds. 93–103.
7.
Holsti, Niklas, Jan Gustafsson, Guillem Bernat, et al.. (2008). WCET TOOL CHALLENGE 2008: REPORT. 5 indexed citations
8.
Kirner, Raimund, et al.. (2008). Towards a Common WCET Annotation Language: Essential Ingredients. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 0. 10 indexed citations
9.
Schordan, Markus, et al.. (2008). TuBound - A Conceptually New Tool for Worst-Case Execution Time Analysis. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 0. 17 indexed citations
10.
Xue, Jingling & Jens Knoop. (2006). A Fresh Look at Partial Redundancy Elimination as a Maximum Flow Problem.. Softwaretechnik-Trends. 26. 1 indexed citations
11.
Knoop, Jens & Oliver Rüthing. (2003). Constant Propagation on Predicated Code.. JUCS - Journal of Universal Computer Science. 9. 829–872. 2 indexed citations
12.
13.
Knoop, Jens, et al.. (2002). Distribution assignment placement: effective optimization of redistribution costs. IEEE Transactions on Parallel and Distributed Systems. 13(6). 628–647. 8 indexed citations
14.
Rüthing, Oliver, Jens Knoop, & Bernhard Steffen. (2000). Sparse code motion. 170–183. 17 indexed citations
15.
Knoop, Jens & Bernhard Steffen. (1999). Code motion for explicitly parallel programs. 13–24. 11 indexed citations
16.
Knoop, Jens. (1998). Eliminating partially dead code in explicitly parallel programs. Theoretical Computer Science. 196(1-2). 365–393. 7 indexed citations
17.
Knoop, Jens, et al.. (1997). Interprocedural distribution assignment placement: more than just enhancing intraprocedural placing techniques. International Conference on Parallel Architectures and Compilation Techniques. 26–37. 3 indexed citations
18.
Knoop, Jens, Oliver Rüthing, & Bernhard Steffen. (1992). Lazy code motion (with retrospective). 460–472. 1 indexed citations
19.
Knoop, Jens, Oliver Rüthing, & Bernhard Steffen. (1992). Lazy code motion. ACM SIGPLAN Notices. 27(7). 224–234. 41 indexed citations
20.
Knoop, Jens, Oliver Rüthing, & Bernhard Steffen. (1992). Lazy code motion. 224–234. 176 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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026