Succinct dynamic cardinal trees
From MaRDI portal
Publication:262263
DOI10.1007/S00453-015-9969-XzbMATH Open1336.68042OpenAlexW2077432808MaRDI QIDQ262263FDOQ262263
Authors: Diego Arroyuelo, Pooya Davoodi, Srinivasa Rao Satti 
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
Recommendations
Cites Work
- Introduction to algorithms.
- Title not available (Why is that?)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Representing dynamic binary trees succinctly
- 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
- Title not available (Why is that?)
- 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?
- Title not available (Why is that?)
- The Complexity of Maintaining an Array and Computing Its Partial Sums
- Ultra-succinct representation of ordered trees with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Balanced parentheses strike back
- Succinct Trees in Practice
- Succinct representation of dynamic trees
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Lowest common ancestors in trees and directed acyclic graphs
- The level ancestor problem simplified
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Representing trees of higher degree
Cited In (12)
- Title not available (Why is that?)
- 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
- Faster dynamic compressed \(d\)-ary relations
- Succinct data structure for dynamic trees with faster queries
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
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)
