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
Publication:1581284
DOI10.1006/jpdc.2000.1638zbMath0962.68004OpenAlexW1974380669MaRDI QIDQ1581284
Sajal K. Das, Maria Cristina Pinotti
Publication date: 13 June 2001
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jpdc.2000.1638
Related Items
Template-driven rainbow coloring of proper interval graphs ⋮ Template-driven rainbow coloring of proper interval graphs