Demo Data from VLDB 2026 / reviewers in the wild / expert
Paul C. Rossbach
dblp:86/3394
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1989
—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 · 50% Integrated circuit design · 25% Memory systems · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation
logic synthesis |
0.0 | 1 | 1989 | Design and application of an optimizing XROM silicon compiler · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989 |
Integrated circuit design
memory circuit design |
0.0 | 1 | 1989 | Design and application of an optimizing XROM silicon compiler · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989 |
Memory systems › non-volatile memory
read-only memory |
0.0 | 1 | 1989 | Design and application of an optimizing XROM silicon compiler · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989 |
Electronic design automation › system-level design › system synthesis
silicon compiler |
0.0 | 1 | 1989 | Design and application of an optimizing XROM silicon compiler · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1989 |
Methods — techniques the papers use, named apart from their topics
traveling salesman problem · 0.0graph partitioning heuristic · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1989 | Design and application of an optimizing XROM silicon compilerabstractIt is demonstrated that optimization techniques incorporated within a silicon compiler for read-only memories (ROMs) can achieve significant yield, power, and speed improvements by minimizing the number of transistors, drains, and metal interconnections in the ROM. Transistor minimization adopts a heuristic solution to the NP-complete graph partitioning problem with a powerful technique applicable to various ROM design styles and technologies. If diffusion mask personalization is permitted, the design can be further improved by solving the traveling salesman problem to minimize transistor source/drain regions. In table look-up ROMs compiled for 3- and 1.2- mu m CMOS with diffusion mask programming, the compiler eliminated over 45% of the transistors and drains. Test results show that 3- mu m CMOS ROMs have access times between 50 and 70 ns. ROMs with 1.2- mu m features achieve simulated access times below 20 ns. A simple interface allows the optimizing compiler to work easily with other CAD tools such as microcode assemblers.> Richard W. Linderman, Paul C. Rossbach, David M. Gallagher |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 2 |