Representing dynamic binary trees succinctly
From MaRDI portal
Recommendations
Cited in
(25)- Succinct dynamic cardinal trees
- scientific article; zbMATH DE number 2038723 (Why is no real title available?)
- Succinct representation of dynamic trees
- A uniform paradigm to succinctly encode various families of trees
- Dynamic Succinct Ordered Trees
- Succinct data structures for searchable partial sums with optimal worst-case performance
- A practical succinct dynamic graph representation
- A new representation of binary search trees
- Succinct representations of planar maps
- Representation of ordered trees with a given degree distribution
- Succinct dynamic cardinal trees with constant time operations for small alphabet
- Succinct representations of ordinal trees
- Fully-functional succinct trees
- Compact searchable static binary trees
- m-Bonsai: a practical compact dynamic trie
- Succinct representation of balanced parentheses and static trees
- Tiny pointers
- Enumeration and succinct encoding of AVL trees
- Fully functional static and dynamic succinct trees
- An Improved Succinct Representation for Dynamic k-ary Trees
- Succinct encodings of binary trees with application to AVL trees
- On succinct representations of binary trees
- A Uniform Approach Towards Succinct Representation of Trees
- Simple and efficient fully-functional succinct trees
- Succinct data structure for dynamic trees with faster queries
This page was built for publication: Representing dynamic binary trees succinctly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768345)
