Three-Dimensional VLSI

DOI10.1145/2402.322384zbMath0624.94019OpenAlexW2052761672MaRDI QIDQ3026917

Arnold L. Rosenberg

Publication date: 1983

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2402.322384

zbMATH Keywords

routinggraph embeddingslayoutpermutation networksFFT circuitsthree-dimensional circuit realizations

Mathematics Subject Classification ID

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

Related Items

Optimal three-dimensional orthogonal graph drawing in the general position model. ⋮ The techniques of Komolgorov and Bardzin for three-dimensional orthogonal graph drawings ⋮ Optimal three-dimensional layouts of complete binary trees ⋮ Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI ⋮ Optimal multilayer channel routing with overlap ⋮ Improved matrix triangularisation using a double pipeline systolic array ⋮ On the complexity of tree embedding problems ⋮ Optimal three-dimensional layout of interconnection networks ⋮ Planar acyclic computation ⋮ Complexities of layouts in three-dimensional VLSI circuits ⋮ Three-dimensional orthogonal graph drawing algorithms ⋮ Optimal three-dimensional VLSI layouts

This page was built for publication: Three-Dimensional VLSI