Pages that link to "Item:Q3660901"
From MaRDI portal
The following pages link to Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees (Q3660901):
Displaying 12 items.
- A framework for solving VLSI graph layout problems (Q796306) (← links)
- Embeddings on a Boolean cube (Q911244) (← links)
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
- Fault-tolerance VLSI sorters (Q1108014) (← links)
- Parallel computation of distance transforms (Q1175646) (← links)
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays (Q1175647) (← links)
- Parallel restructuring and evaluation of expressions (Q1185242) (← links)
- Embedding meshes of trees into deBruijn graphs (Q1199946) (← links)
- Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space (Q1318772) (← links)
- Reconfigurable meshes and image processing (Q1898157) (← links)
- Representing shared data on distributed-memory parallel computers (Q4866678) (← links)
- Parallel computation of discrete Voronoi diagrams (Q5096154) (← links)
