Optimal mappings of q-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates
From MaRDI portal
(Redirected from Publication:1581284)
Recommendations
Cited in
(11)- On a parallel memory to access trees
- Load balanced mapping of data structures in parallel memory modules for fast and conflict-free templates access
- scientific article; zbMATH DE number 4033049 (Why is no real title available?)
- scientific article; zbMATH DE number 4092740 (Why is no real title available?)
- On coloring complete binary trees
- Template-driven rainbow coloring of proper interval graphs
- scientific article; zbMATH DE number 4030978 (Why is no real title available?)
- Template-driven rainbow coloring of proper interval graphs
- scientific article; zbMATH DE number 1696651 (Why is no real title available?)
- Mappings for conflict-free access of paths in bidimensional arrays, circular lists, and complete trees
- scientific article; zbMATH DE number 1424319 (Why is no real title available?)
This page was built for publication: Optimal mappings of \(q\)-ary and binomial trees into parallel memory modules for fast and conflict-free access to path and subtree templates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1581284)