Recommendations
Cites work
- scientific article; zbMATH DE number 2185599 (Why is no real title available?)
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 2038723 (Why is no real title available?)
- scientific article; zbMATH DE number 1830754 (Why is no real title available?)
- An Improved Succinct Representation for Dynamic k-ary Trees
- An analysis of the Burrows-Wheeler transform
- Balanced parentheses strike back
- Compressed indexes for dynamic text collections
- Compressed representations of sequences and full-text indexes
- Compressing and indexing labeled trees, with applications
- Fully functional static and dynamic succinct trees
- Introduction to algorithms.
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Lowest common ancestors in trees and directed acyclic graphs
- Representing dynamic binary trees succinctly
- Representing trees of higher degree
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
- Succinct Trees in Practice
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Succinct dynamic cardinal trees with constant time operations for small alphabet
- Succinct ordinal trees with level-ancestor queries
- Succinct representation of balanced parentheses and static trees
- Succinct representation of dynamic trees
- The Complexity of Maintaining an Array and Computing Its Partial Sums
- The level ancestor problem simplified
- Ultra-succinct representation of ordered trees with applications
- Universal Succinct Representations of Trees?
Cited in
(12)- Succinct Indexable Dictionaries with Applications to Encoding k-ary Trees, Prefix Sums and Multisets
- scientific article; zbMATH DE number 2038723 (Why is no real title available?)
- Dynamic Path-decomposed Tries
- Representation of ordered trees with a given degree distribution
- Succinct dynamic cardinal trees with constant time operations for small alphabet
- LZ78 compression in low main memory space
- Engineering practical Lempel-Ziv tries
- m-Bonsai: a practical compact dynamic trie
- Fully functional static and dynamic succinct trees
- An Improved Succinct Representation for Dynamic k-ary Trees
- Succinct data structure for dynamic trees with faster queries
- Faster dynamic compressed \(d\)-ary relations
This page was built for publication: Succinct dynamic cardinal trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q262263)
