Coding Binary Trees by Words over an Alphabet with Four Letters
From MaRDI portal
Recommendations
Cites work
- A note on generating binary trees inA-order andB-order
- A numbering system for binary trees
- A survey in binary tree codings
- Enumerating, Ranking and Unranking Binary Trees
- Generating Binary Trees Lexicographically
- Generation of Binary Trees from Ballot Sequences
- scientific article; zbMATH DE number 3757724 (Why is no real title available?)
- Lexicographic generation of ordered trees
- On a correspondence between binary trees and a certain type of permutation
- Permutation representation of k-ary trees
- Ranking and Listing Algorithms for k-Ary Trees
- Ranking and Unranking of Non-regular Trees
- Stack sortable permutations
Cited in
(7)- scientific article; zbMATH DE number 475410 (Why is no real title available?)
- Generating binary trees in A-order from codewords defined on a four-letter alphabet
- Ranking and unrankingk-ary trees with a 4k –4 letter alphabet
- scientific article; zbMATH DE number 1472176 (Why is no real title available?)
- scientific article; zbMATH DE number 743588 (Why is no real title available?)
- Explicit binary tree codes with polylogarithmic size alphabet
- On binary tree encodements
This page was built for publication: Coding Binary Trees by Words over an Alphabet with Four Letters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024145)
