Tree-based parallel algorithm design
From MaRDI portal
Recommendations
- Parallel algorithms for tree traversals
- Parallel algorithms for tree accumulations
- scientific article; zbMATH DE number 2100400
- scientific article; zbMATH DE number 3958748
- scientific article; zbMATH DE number 54593
- Efficient parallel algorithms for some tree layout problems
- A parallel tree difference algorithm
- Parallel implementation of tree skeletons
Cited in
(16)- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
- Scheduling tree dags on parallel architectures
- Balanced computation of two-dimensional transforms on a tree machine
- The Hamiltonian problem on distance-hereditary graphs
- scientific article; zbMATH DE number 3876584 (Why is no real title available?)
- Optimal parallel generation of a computation tree form
- scientific article; zbMATH DE number 3907763 (Why is no real title available?)
- Tree transformation problem in microparallelism algorithms
- scientific article; zbMATH DE number 3958748 (Why is no real title available?)
- scientific article; zbMATH DE number 3982465 (Why is no real title available?)
- scientific article; zbMATH DE number 4064461 (Why is no real title available?)
- Efficient parallel algorithms for some tree layout problems
- Parallelizing the closure computation in automated deduction
- A parallel tree difference algorithm
- Parallel computation of arithmetic expressions involving unary functions
- Pipelining tree-structured algorithms on SIMD architectures
This page was built for publication: Tree-based parallel algorithm design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386764)
