An Improved Succinct Representation for Dynamic k-ary Trees

DOI10.1007/978-3-540-69068-9_26zbMath1143.68381OpenAlexW1782136421MaRDI QIDQ3506960

Diego Arroyuelo

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69068-9_26

Mathematics Subject Classification ID

Data structures (68P05) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (6)

Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet ⋮ Dynamic extended suffix arrays ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Fully Functional Static and Dynamic Succinct Trees ⋮ Linked dynamic tries with applications to LZ-compression in sublinear time and space ⋮ Succinct dynamic cardinal trees

This page was built for publication: An Improved Succinct Representation for Dynamic k-ary Trees