Succinct dynamic cardinal trees
From MaRDI portal
Publication:262263
DOI10.1007/s00453-015-9969-xzbMath1336.68042OpenAlexW2077432808MaRDI QIDQ262263
Srinivasa Rao Satti, Pooya Davoodi, Diego Arroyuelo
Publication date: 29 March 2016
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-015-9969-x
Related Items (6)
Representation of ordered trees with a given degree distribution ⋮ Dynamic Path-decomposed Tries ⋮ Engineering Practical Lempel-Ziv Tries ⋮ Succinct data structure for dynamic trees with faster queries ⋮ m-Bonsai: A Practical Compact Dynamic Trie ⋮ LZ78 Compression in Low Main Memory Space
Cites Work
- Ultra-succinct representation of ordered trees with applications
- Succinct representation of dynamic trees
- Space-efficient construction of Lempel-Ziv compressed text indexes
- The level ancestor problem simplified
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Representing trees of higher degree
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Succinct Representation of Balanced Parentheses and Static Trees
- Fully Functional Static and Dynamic Succinct Trees
- Succinct ordinal trees with level-ancestor queries
- Compressed representations of sequences and full-text indexes
- Compressed indexes for dynamic text collections
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet
- An analysis of the Burrows—Wheeler transform
- Compressing and indexing labeled trees, with applications
- An Improved Succinct Representation for Dynamic k-ary Trees
- Universal Succinct Representations of Trees?
- The Complexity of Maintaining an Array and Computing Its Partial Sums
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Balanced parentheses strike back
- Optimal Dynamic Sequence Representations
- Succinct Trees in Practice
- Lowest common ancestors in trees and directed acyclic graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Succinct dynamic cardinal trees