Optimal three-dimensional VLSI layouts

DOI10.1007/BF01744565MaRDI QIDQ4739807zbMATH OpenFDO

Authors F. P. Preparata

Publication date 1983

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01744565

zbMATH Keywords

all-active-volume modecube-connected-cycleslayoutnetworkone- active-layer modesolid chip

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 3845502
• VLSI design in the 3rd dimension
• scientific article; zbMATH DE number 5657967
• Three-Dimensional VLSI
• Three-Dimensional Integrated Circuit Layout
• scientific article; zbMATH DE number 2010437
• scientific article; zbMATH DE number 139786
• Optimal three-dimensional layout of interconnection networks

Cites work

• Optimal Rearrangeable Multistage Connecting Networks
• Parallel Processing with the Perfect Shuffle
• Three-Dimensional VLSI

Cited in

(14)

• Optimal three-dimensional layouts of complete binary trees
• The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings
• Three-dimensional orthogonal graph drawing algorithms
• An asymptotically optimal layout for the shuffle-exchange graph
• Layout of the cube-connected cycles without long wires
• Discrete Relaxation Method for Triple Patterning Lithography Layout Decomposition
• Three-Dimensional VLSI
• scientific article; zbMATH DE number 3845502 (Why is no real title available?)
• scientific article; zbMATH DE number 5657967 (Why is no real title available?)
• Three-Dimensional Circuit Layouts
• scientific article; zbMATH DE number 139786 (Why is no real title available?)
• Optimal three-dimensional layout of interconnection networks
• Planar acyclic computation
• Complexities of layouts in three-dimensional VLSI circuits

This page was built for publication: Optimal three-dimensional VLSI layouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4739807)