Three-Dimensional VLSI
From MaRDI portal
Recommendations
Cited in
(17)- scientific article; zbMATH DE number 3845502 (Why is no real title available?)
- The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
- Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI
- Optimal three-dimensional orthogonal graph drawing in the general position model.
- Optimal three-dimensional VLSI layouts
- Optimal three-dimensional layout of interconnection networks
- scientific article; zbMATH DE number 5657967 (Why is no real title available?)
- Three-dimensional orthogonal graph drawing algorithms
- Planar acyclic computation
- Complexities of layouts in three-dimensional VLSI circuits
- Optimal three-dimensional layouts of complete binary trees
- On the complexity of tree embedding problems
- Optimal multilayer channel routing with overlap
- Improved matrix triangularisation using a double pipeline systolic array
- Three-Dimensional Integrated Circuit Layout
- scientific article; zbMATH DE number 434571 (Why is no real title available?)
- Routing in a three-dimensional chip
This page was built for publication: Three-Dimensional VLSI
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026917)