1. Toward a universal mapping algorithm for accessing trees in parallel memory systems;Auletta,1998
2. Biased finger trees and three-dimensional layers of maxima;Atallah,1994
3. On the effectiveness of interleaved memories for binary trees;Boppana,1993
4. Conflict-free access to parallel memories;Colbourn;J. Parallel Distrib. Comput.,1992
5. Recent results on the parallel access to tree-like data structures—The isotropic approach;Creutzburg,1991