A lot of memory is wasted in Java containers, see e.g., Memory-efficient Java Applications. Very often data structures are build up in a setup-phase and never altered again. The computation intensive ...

Abstract: Complete binary spanning trees of an n x n array of processors with an eight nearest neighbor interconnection pattern exist for a limited value of n. These spanning trees provide a fast ...

Abstract: This paper considers the problem of embedding complete binary trees into meshes using the row-column routing and obtained the following results: a complete binary tree with 2/sup p/-1 nodes ...