Giovanni Manzini

Extended Depth-First Representations of k2-trees

It is demonstrated that depth-first layouts of $k^2$-trees provide a practical and efficient alternative to traditional layouts, improving both compression and computational performance in matrix operations.