Succinct encodings of binary trees with application to AVL trees
From MaRDI portal
Cites work
- A uniform paradigm to succinctly encode various families of trees
- An invitation to analytic combinatorics. From one to several variables
- Analytic combinatorics
- Balanced search trees made simple
- Enumeration and succinct encoding of AVL trees
- scientific article; zbMATH DE number 3865301 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 3435566 (Why is no real title available?)
- scientific article; zbMATH DE number 6876094 (Why is no real title available?)
- scientific article; zbMATH DE number 7740925 (Why is no real title available?)
- Lagrange inversion
- On the asymptotic behaviour of analytic solutions of linear iterative functional equations
- On the efficiency of a new method of dictionary construction
- Optimal 2,3-Trees
- Periodic oscillations of coefficients of power series that satisfy functional equations
- Rank-Balanced Trees
- Representing dynamic binary trees succinctly
- Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting
- Succinct Ordinal Trees Based on Tree Covering
- Tables
- Trees, Forests and Rearranging
This page was built for publication: Succinct encodings of binary trees with application to AVL trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6903529)