Succinct Trees in Practice
From MaRDI portal
Publication:5233599
DOI10.1137/1.9781611972900.9zbMath1429.68044OpenAlexW1507759507MaRDI QIDQ5233599
Rodrigo Cánovas, Kunihiko Sadakane, Diego Arroyuelo, Gonzalo Navarro
Publication date: 11 September 2019
Published in: 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1.9781611972900.9
Related Items
On succinct representations of binary trees, GLOUDS: representing tree-like graphs, Simultaneous encodings for range and next/previous larger/smaller value queries, Grammar compressed sequences with rank/select support, Improved range minimum queries, Succinct encoding of binary strings representing triangulations, Parallel construction of succinct trees, Practical compressed suffix trees, Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures, Simple and efficient fully-functional succinct trees, Space-efficient construction of Lempel-Ziv compressed text indexes, Lempel-Ziv compressed structures for document retrieval, Fast Compressed Tries through Path Decompositions, General Document Retrieval in Compact Space, Constant delay traversal of grammar-compressed graphs with bounded rank, Faster Compressed Suffix Trees for Repetitive Collections, Practical Compact Indexes for Top-kDocument Retrieval, Succinct dynamic cardinal trees
