From the 1 of 3 linked papers with an AI index.
3 papers
cs.DS2026
Extended Depth-First Representations of -trees
Gabriel Carmona, Paolo Ferragina, Giovanni Manzini +1
The paper proposes depth‑first memory layouts for k²‑trees, including plain and balanced‑parentheses variants and compressed versions, and shows they improve cache performance, com…
cs.DS2025
Depth first representations of -trees
Gabriel Carmona, Giovanni Manzini
The -tree is a compact data structure designed to efficiently store sparse binary matrices by leveraging both sparsity and clustering of nonzero elements. This representation…
cs.DS2024
Engineering Rank/Select Data Structures for Large-Alphabet Strings
Diego Arroyuelo, Gabriel Carmona, Héctor Larrañaga +3
Large-alphabet strings are common in scenarios such as information retrieval and natural-language processing. The efficient storage and processing of such strings usually introduce…