Demo Data from EDBT 2026 / reviewers in the wild / expert
Robert K. Korn
dblp:13/6855
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author
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
2 papers |
Electronic design automation · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation
physical design |
0.0 | 2 | 1985 | Hierarchical VLSI Routing - An Approximate Routing Procedure · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1985 An efficient variable-cost maze router · DAC 1982 |
Electronic design automation › physical design
routing |
0.0 | 2 | 1985 | Hierarchical VLSI Routing - An Approximate Routing Procedure · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1985 An efficient variable-cost maze router · DAC 1982 |
Electronic design automation › physical design › routing › wire routing
maze routing |
0.0 | 1 | 1982 | An efficient variable-cost maze router · DAC 1982 |
Electronic design automation › physical design › placement and routing
gate array layout |
0.0 | 1 | 1985 | Hierarchical VLSI Routing - An Approximate Routing Procedure · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1985 |
Electronic design automation › physical design › routing
multilayer routing |
0.0 | 1 | 1982 | An efficient variable-cost maze router · DAC 1982 |
Methods — techniques the papers use, named apart from their topics
hierarchical wiring scheme · 0.0approximate routing procedure · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Hierarchical VLSI Routing - An Approximate Routing ProcedureabstractThis paper describes an approximate routing procedure. The procedure is quite general and could be applied to both printed circuit boards and integrated circuit chip wiring procedures where a hierarchical wiring scheme is utilized. This procedure has been incorporated in sperry's automatic gate array chip layout system. Arvind M. Patel, Norman L. Soong, Robert K. Korn |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 3 |
| 1982 | An efficient variable-cost maze routerabstractA variable cost maze router is described. The router is substantially faster than most other maze routers and also provides a flexibility which is valuable in a variety of ways. It is particularly well suited for use on multiple layer routing surfaces in which adjacent layers have primary wire directions which are perpendicular to each other. The router has been incorporated as a final phase into both a circuit board routing system and an LSI gate array router. Experience with these systems is described. Potential applications of the variable cost ability are also discussed. Robert K. Korn |
DAC | 1 |