Demo Data from EDBT 2026 / reviewers in the wild / expert
King C. Ho
dblp:20/6868
· DBLP profile ↗
2ranked-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-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 · 75% Storage systems · 21% Integrated circuit design · 4% |
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 | 1994 | Interval graph algorithms for two-dimensional multiple folding of array-based VLSI layouts · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994 Flexible Transistor Matrix (FTM) · DAC 1991 |
Electronic design automation › design optimization
area optimization |
0.0 | 1 | 1994 | Interval graph algorithms for two-dimensional multiple folding of array-based VLSI layouts · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994 |
Storage systems › key-value storage
compaction |
0.0 | 1 | 1994 | Interval graph algorithms for two-dimensional multiple folding of array-based VLSI layouts · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994 |
Electronic design automation › physical design
layout optimization |
0.0 | 1 | 1994 | Interval graph algorithms for two-dimensional multiple folding of array-based VLSI layouts · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1994 |
Integrated circuit design
digital circuit design |
0.0 | 1 | 1991 | Flexible Transistor Matrix (FTM) · DAC 1991 |
Methods — techniques the papers use, named apart from their topics
interval graph · 0.0graph coloring · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Interval graph algorithms for two-dimensional multiple folding of array-based VLSI layoutsabstractFolding or topological compaction of array-based VLSI layouts is an important optimization step that is carried out after logic synthesis. In this paper, a new approach to two-dimensional multiple folding of array-based VLSI layouts is presented. From the specification of the problem a pair of intersection graphs is created. We show that any pair of interval graphs that contain the intersection graphs as spanning subgraphs corresponds to a set of feasible foldings. Next, a complete and exact characterization of the folding problem is presented. In particular, it is shown that the set of all feasible foldings associated with a given pair of interval graphs corresponds to the set of independent colorings of a pair of compatibility graphs. The compatibility graphs are derived from a pair of interval graphs that contain the intersection graphs as spanning subgraphs. Thus, minimizing the area of a layout is tantamount to finding a pair of compatibility graphs such that the product of their chromatic numbers is minimum. As important as minimizing the area of a layout is, the ability to rapidly generate compact layouts over a wide range of aspect ratios is often equally, if not more, important. The interval graph-based formulation of the folding problem permits a controlled and systematic generation of compact layouts with varying aspect ratios. Efficient and provably correct algorithms to generate compact layouts that have a given number of rows or a given number of columns within their minimum and maximum possible values are given. The basic theory and methods are extended to include I/O and other types of constraints. Finally, the results of experiments that were carried out on a large number of benchmark problems are given. These results are compared with those obtained by previously reported methods.> King C. Ho, Sarma B. K. Vrudhula |
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. | 1 |
| 1991 | Flexible Transistor Matrix (FTM)abstractThis paper describes a new layout style called the Flexible Transistor Matrix (FTM) for large scale CMOS module generation.FTM uses two layers of metal.Compared to Gate Matrix, FTM can generate significantly better results.In addition, the algorithm can control the aspect ratio, 1/0 pin positions and different transistor sizes. King C. Ho, Sarma Sastry |
DAC | 1 |