Reinhold Heckmann

4.1k total citations · 1 hit paper
44 papers, 2.0k citations indexed

About

Reinhold Heckmann is a scholar working on Computational Theory and Mathematics, Hardware and Architecture and Artificial Intelligence. According to data from OpenAlex, Reinhold Heckmann has authored 44 papers receiving a total of 2.0k indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computational Theory and Mathematics, 17 papers in Hardware and Architecture and 14 papers in Artificial Intelligence. Recurrent topics in Reinhold Heckmann's work include Real-Time Systems Scheduling (17 papers), Embedded Systems Design Techniques (12 papers) and Advanced Topology and Set Theory (10 papers). Reinhold Heckmann is often cited by papers focused on Real-Time Systems Scheduling (17 papers), Embedded Systems Design Techniques (12 papers) and Advanced Topology and Set Theory (10 papers). Reinhold Heckmann collaborates with scholars based in Germany, United States and United Kingdom. Reinhold Heckmann's co-authors include Christian Ferdinand, Reinhard Wilhelm, Stephan Thesing, Peter Puschner, Jan Staschulat, Andreas Ermedahl, Tulika Mitra, David Whalley, Jakob Engblom and Guillem Bernat and has published in prestigious journals such as Proceedings of the IEEE, Annals of the New York Academy of Sciences and SAE technical papers on CD-ROM/SAE technical paper series.

In The Last Decade

Reinhold Heckmann

39 papers receiving 1.8k citations

Hit Papers

align trajectories

What are hit papers?

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

2008 1.1k citations Reinhard Wilhelm, Stephan Thesing et al. profile →

Peers

Countries citing papers authored by Reinhold Heckmann

Since Specialization

Citations

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

Fields of papers citing papers by Reinhold Heckmann

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Reinhold Heckmann

This figure shows the co-authorship network connecting the top 25 collaborators of Reinhold Heckmann. A scholar is included among the top collaborators of Reinhold Heckmann 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 Reinhold Heckmann. Reinhold Heckmann is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	Software Structure and WCET Predictability 2011 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·(unknown), (unknown), Reinhold Heckmann	4
2	Similarity, topology, and uniformity 2009 ·The Journal of Logic and Algebraic Programming ·Reinhold Heckmann	2
3	Worst-Case Execution Time - A Tool Provider's Perspective 2008 ·Christian Ferdinand, Reinhold Heckmann	9
4	Computing the Worst Case Execution Time of an Avionics Program by Abstract Interpretation 2008 ·DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) ·Jean Souyris, (unknown), (unknown), (unknown), (unknown), Reinhold Heckmann	45
5	Injective Convergence Spaces and Equilogical Spaces via Pretopological Spaces 2006 ·Electronic Notes in Theoretical Computer Science ·Reinhold Heckmann	0
6	Static Memory and Execution Time Analysis of Embedded Code 2006 ·SAE technical papers on CD-ROM/SAE technical paper series ·Christian Ferdinand, Reinhold Heckmann	2
7	The Embounded project (project start paper). 2005 ·Kevin Hammond, Roy Dyckhoff, Christian Ferdinand, Reinhold Heckmann, Martin Hofmann, (unknown), Hans‐Wolfgang Loidl, Greg Michaelson, (unknown), Norman Scaife, Jocelyn Sérot, Andrew Wallace	0
8	An abstract interpretation-based timing validation of hard real-time avionics software 2004 ·Stephan Thesing, Jean Souyris, Reinhold Heckmann, (unknown), (unknown), Reinhard Wilhelm, Christian Ferdinand	48
9	Validierung des Zeitverhaltens von kritischer Echtzeit-Software 2003 ·GI Jahrestagung (1) ·Christian Ferdinand, Daniel L. Kastner, Florian Martin, (unknown), (unknown), (unknown), Reinhold Heckmann, (unknown), Stephan Thesing, Frank Fontaine, Henrik Theiling, Michael D. Schmidt, (unknown), Reinhard Wilhelm	0
10	The influence of processor architecture on the design and the results of WCET tools 2003 ·Proceedings of the IEEE ·Reinhold Heckmann, (unknown), Stephan Thesing, Reinhard Wilhelm	157
11	Contractivity of linear fractional transformations 2002 ·Theoretical Computer Science ·Reinhold Heckmann	6
12	Computing with Real Numbers - I. The LFT Approach to Real Number Computation - II. A Domain Framework for Computational Geometry 2002 ·Abbas Edalat, Reinhold Heckmann	5
13	Characterising FS domains by means of power domains 2001 ·Theoretical Computer Science ·Reinhold Heckmann	4
14	How Many Argument Digits are Needed to Produce n Result Digits? 2000 ·Electronic Notes in Theoretical Computer Science ·Reinhold Heckmann	3
15	A computational model for metric spaces 1998 ·Theoretical Computer Science ·Abbas Edalat, Reinhold Heckmann	119
16	LOWER BAG DOMAINS 1995 ·Fundamenta Informaticae ·Reinhold Heckmann	6
17	Stable power domains 1994 ·Theoretical Computer Science ·Reinhold Heckmann	4
18	Observable modules and power domain constructions 1993 ·Reinhold Heckmann	1
19	Power domains and second-order predicates 1993 ·Theoretical Computer Science ·Reinhold Heckmann	17
20	Power domain constructions 1991 ·Science of Computer Programming ·Reinhold Heckmann	35

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