Demo Data from SIGIR 2026 / reviewers in the wild / expert
F. H. Kirsch
dblp:49/3881
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1990
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › physical design › routing › VLSI routing
any-angle routing |
0.0 | 1 | 1990 | A Gridless Router for Industrial Design Rules · DAC 1990 |
Electronic design automation › physical design › routing › detailed routing
gridless routing |
0.0 | 1 | 1990 | A Gridless Router for Industrial Design Rules · DAC 1990 |
Electronic design automation
physical design |
0.0 | 1 | 1990 | A Gridless Router for Industrial Design Rules · DAC 1990 |
Methods — techniques the papers use, named apart from their topics
computational geometry · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | A Gridless Router for Industrial Design RulesabstractA point-to-point routing algorithm with three new features is presented. First, the router makes optimal use of oversized, rectangular contacts. Second, it allows different wire width on different layers, with the layers having complete freedom as to routing direction. These two features make the algorithm attractive for MOS layout applications. Finally it is able to realize all-angle routing and to accept all-angle obstacles, a feature interesting for hybrid and PCB routing. The router is gridless and guarantees a solution if one exists. Since it is based on computational geometry algorithms, it offers a low run-time complexity. The ideas have been implemented in a prototype version for 45° routing. The results indicate that the router performs well, even on large designs. Werner L. Schiele, Thomas Krüger, Knut M. Just, F. H. Kirsch |
DAC | 4 |