par Demaine, Erik D. ;Iacono, John ;Langerman, Stefan
Référence Algorithmica, 72, 2, page (369-378)
Publication Publié, 2015-06
Article révisé par les pairs
Résumé : Consider laying out a fixed-topology binary tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse a path from the root to a node of depth D. We prove that the optimal number of memory transfers is (Formula Presented.)