The following pages link to Three-Dimensional Circuit Layouts (Q3753506):
Displaying 12 items.
- Optimal placement of UV-based communications relay nodes (Q604957) (← links)
- Planar acyclic computation (Q751805) (← links)
- Complexities of layouts in three-dimensional VLSI circuits (Q753802) (← links)
- Routing vertex disjoint Steiner-trees in a cubic grid and connections to VLSI (Q858297) (← links)
- Optimal three-dimensional layouts of complete binary trees (Q1099137) (← links)
- Communication-efficient parallel algorithms for distributed random-access machines (Q1104096) (← links)
- A compact layout for the three-dimensional tree of meshes (Q1105621) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- An asymptotically optimal layout for the shuffle-exchange graph (Q1838315) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- Planar Graphs of Bounded Degree Have Bounded Queue Number (Q5235482) (← links)
- Optimal three-dimensional layout of interconnection networks (Q5941072) (← links)
