Demo Data from EDBT 2026 / reviewers in the wild / expert
Jürgen Doenhardt
dblp:75/1540
· DBLP profile ↗
3ranked-venue papers
2as first author
0since 2021 · last 1989
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 100% | |
| Theoretical computer science
1 paper |
Graph algorithms and graph theory · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › physical design
layout compaction |
0.0 | 1 | 1987 | Algorithmic Aspects of One-Dimensional Layout Compaction · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987 |
Electronic design automation
physical design |
0.0 | 1 | 1987 | Algorithmic Aspects of One-Dimensional Layout Compaction · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987 |
Graph algorithms and graph theory
graph algorithms |
0.0 | 1 | 1987 | Algorithmic Aspects of One-Dimensional Layout Compaction · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987 |
Graph algorithms and graph theory
shortest path |
0.0 | 1 | 1987 | Algorithmic Aspects of One-Dimensional Layout Compaction · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1987 |
Methods — techniques the papers use, named apart from their topics
graph-theoretic compaction · 0.0single-source shortest-path · 0.0single-source shortest path · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | Fault Masking Probabilities with Single and Multiple Signature Analysis
Jürgen Doenhardt |
STACS | 1 |
| 1987 | Algorithmic Aspects of One-Dimensional Layout CompactionabstractWe present a theory of one-dimensional layout compaction that is based on the graph theoretic approach used in such compacters as reported in [5], [7], [11], and [26]. Compaction here consists of two steps. In the first stage, a directed graph is extracted from the layout. In the second stage, compaction is performed by solving a single-source shortest path problem on this graph. The paper presents new efficient algorithms and/or heuristics for the first stage of the compaction process. A compacter based on the framework presented here that incorporates the algorithms described is a powerful tool that can easily be tailored to specific applications. It allows a tradeoff between the space and runtime performance of the compacter and the quality of the compaction. Jürgen Doenhardt, Thomas Lengauer |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 1 |
| 1982 | A Probabilistic Algorithm for Vertex Connectivity of Graphs
Michael Becker 0009, W. Degenhardt, Jürgen Doenhardt, Stefan Hertel, Gerd Kaninke, W. Kerber, Kurt Mehlhorn, Stefan Näher, Hans Rohnert, Thomas Winter |
Inf. Process. Lett. | 3 |