Solving tree problems on a mesh-connected processor array
From MaRDI portal
Recommendations
Cited in
(18)- Solving visibility and separability problems on a mesh-of-processors
- Topological numbering of features on a mesh
- Efficient parallel computations on the reduced mesh of trees organization
- Time-optimal tree computations on sparse meshes
- Parallel matrix product algorithm in the de Bruijn network using emulation of meshes of trees
- List-ranking on interconnection networks.
- The balanced binary tree technique on mesh-connected computers
- scientific article; zbMATH DE number 3876584 (Why is no real title available?)
- Graph Problems on a Mesh-Connected Processor Array
- scientific article; zbMATH DE number 742956 (Why is no real title available?)
- Complexity of Sub-Bus Mesh Computations
- scientific article; zbMATH DE number 3894474 (Why is no real title available?)
- Time-optimal tree computations on sparse meshes
- Randomized parallel list ranking for distributed memory multiprocesors
- Randomized parallel list ranking for distributed memory multiprocessors.
- Determining maximum \(k\)-width-connectivity on meshes
- Leftmost one computation on meshes with row broadcasting
- Parallel general prefix computations with geometric, algebraic, and other applications
This page was built for publication: Solving tree problems on a mesh-connected processor array
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3742734)
