- Vertical Slit Field Effect Transistor in ultra-low power applications
- Can pin access limit the footprint scaling?
- A Low Energy Network-on-Chip Fabric for 3-D Multi-Core Architectures
- Investigation of emerging middle-of-line poly gate-to-diffusion contact reliability issues
- Metrics for characterizing machine learning-based hotspot detection methods
- A study on cell-level routing for VeSFET circuits
- On Cell Layout-Performance Relationships in VeSFET-Based, High-Density Regular Circuits
An Unconstrained Topological Via Minimization Problem for Two-Layer Routing
| Title | An Unconstrained Topological Via Minimization Problem for Two-Layer Routing |
| Publication Type | Journal Article |
| Year of Publication | 1984 |
| Authors | Marek-Sadowska, M |
| Journal | Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on |
| Volume | 3 |
| Pagination | 184 - 190 |
| Date Published | july |
| ISSN | 0278-0070 |
| Abstract | Based on graph theory, a study of via minimization problem is presented. We show that the simplest problem of this type is NP-complete and propose a heuristic algorithm for topological via minimization. |
| DOI | 10.1109/TCAD.1984.1270074 |
