Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
From MaRDI portal
Publication:3660901
DOI10.1109/TC.1983.1676279zbMATH Open0514.68029MaRDI QIDQ3660901FDOQ3660901
Authors: Dhruva Nath, S. N. Maheshwari, P. C. P. Bhatt
Publication date: 1983
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
interconnection networksmatrix multiplicationparallel algorithmssortingparallel processingarea-time complexityorthogonal trees networks
Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)
Cited In (12)
- Fault-tolerance VLSI sorters
- Reconfigurable meshes and image processing
- Parallel computation of discrete Voronoi diagrams (extended abstract)
- Embedding meshes of trees into deBruijn graphs
- Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space
- A framework for solving VLSI graph layout problems
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- Embeddings on a Boolean cube
- Parallel restructuring and evaluation of expressions
- An adaptive and cost-optimal parallel algorithm for minimum spanning trees
- Representing shared data on distributed-memory parallel computers
- Parallel computation of distance transforms
This page was built for publication: Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3660901)