Vectorization of tree traversals
From MaRDI portal
Recommendations
- Parallel algorithms for tree traversals
- scientific article; zbMATH DE number 2100400
- Succinct and I/O Efficient Data Structures for Traversal in Trees
- Succinct and I/O efficient data structures for traversal in trees
- A taxonomy of binary tree traversals
- scientific article; zbMATH DE number 4174333
- Tree enumeration and tree algorithm complexity computation
- Parallel Shortcutting of Rooted Trees
Cites work
Cited in
(10)- Minimizing access pointers into trees and arrays
- Object-oriented tree traversal with JJForester.
- A modified tree code: Don't laugh; it runs
- Vectorization of a treecode
- Smooth particle hydrodynamics: importance of correction terms in adaptive resolution algorithms.
- Calculating short range forces on a massively parallel computer: SPH on the Connection Machine
- Calculational derivation of pointer algorithms from tree operations
- Comparison of two different tree algorithms
- Do-it-yourself computational astronomy. Hardwares, algorithms, softwares, and sciences
- Tree Interpolation in Vampire
This page was built for publication: Vectorization of tree traversals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582042)