Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Dirk Theune

dblp:20/3395 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 2 · 2 first-authorTheory of computation · 2

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
Mathematical optimization · 67% Graph algorithms and graph theory · 33%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.011994
Robust methods for EMC-driven routing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Electronic design automation › physical design
routing
0.011994
Robust methods for EMC-driven routing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994
Mathematical optimization
multi-objective optimization
0.011991
Efficient Algorithms for Path Problems with Gernal Cost Citeria · ICALP 1991
Mathematical optimization › combinatorial optimization › network optimization
path optimization
0.011991
Efficient Algorithms for Path Problems with Gernal Cost Citeria · ICALP 1991
Graph algorithms and graph theory › graph algorithms
path problems
0.011991
Efficient Algorithms for Path Problems with Gernal Cost Citeria · ICALP 1991
Electronic design automation › physical design › routing
printed circuit board routing
0.011994
Robust methods for EMC-driven routing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994

Methods — techniques the papers use, named apart from their topics

robust routing algorithms · 0.0EMC design models · 0.0
YearPublicationVenuePosition
1994 Robust methods for EMC-driven routing
abstract
Due to the application of fast device technologies and the increasing complexity of printed-circuit boards, electromagnetic phenomena, e.g. reflections and crosstalk, gain more and more importance and may even disturb the function of a circuit. In the future, it will be indispensable to already consider phenomena of electromagnetic compatibility (EMC) during layout synthesis. In this paper, robust methods are presented that make it possible for the first time to incorporate complex EMC constraints and cost criteria into printed-circuit board routing. This includes both concepts for the development and specification of EMC design models and robust and efficient algorithms for EMC-driven routing that can handle these models.>
Dirk Theune, Ralf Thiele, Werner John, Thomas Lengauer
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1992 HERO: hierarchical EMC-constrained routing
abstract
The authors point out that, in order to perform the design of printed circuit boards as time- and cost-efficiently as possible, electromagnetic compatability (EMC) phenomena have to be taken into account during layout synthesis. The EMC router HERO offers a robust framework for incorporating EMC constraints and cost criteria into routing. Using HERO, it will not be possible to obtain a completely failsafe layout, in general. However, experimental results for typical boards prove that a great number of EMC problems can be avoided during layout synthesis and that the effects of EMC phenomena can be reduced substantially. Detailed reports of EMC design rule violations provide effective input to the succeeding EMC verification phase. Violations of EMC design rules are mainly caused by an inappropriate placement. Therefore, it seems to be of great promise to combine hierarchical placement methods with this approach for hierarchical routing.>
Dirk Theune, Ralf Thiele, Thomas Lengauer, Anja Feldmann
ICCAD1
1991 Efficient Algorithms for Path Problems with Gernal Cost Citeria
Thomas Lengauer, Dirk Theune
ICALP2
1991 Unstructured Path Problems and the Making of Semirings (Preliminary Version)
Thomas Lengauer, Dirk Theune
WADS2