Enumerating, Ranking and Unranking Binary Trees
From MaRDI portal
Publication:3709911
Recommendations
Cited in
(65)- Catalan intervals and uniquely sorted permutations
- scientific article; zbMATH DE number 5844196 (Why is no real title available?)
- An efficient upper bound of the rotation distance of binary trees
- Recursive constructions for the higher Stasheff-Tamari orders in dimension three using the outer Tamari and Tamari block posets
- A decidable word problem without equivalent canonical term rewriting system
- Generating trees withnnodes andmleaves
- Coding Binary Trees by Words over an Alphabet with Four Letters
- Gray code generation of binary trees encoded in left-child sequences
- On a subposet of the Tamari lattice
- scientific article; zbMATH DE number 5279360 (Why is no real title available?)
- Ranking and unranking of non-regular trees with a prescribed branching sequence
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
- Efficient lower and upper bounds of the diagonal-flip distance between triangulations
- Three Fuss-Catalan posets in interaction and their associative algebras
- scientific article; zbMATH DE number 5130543 (Why is no real title available?)
- The Tamari block lattice: an order on saturated chains in the Tamari lattice
- Weak associativity and restricted rotation
- Ranking and Unranking of Non-regular Trees
- Generating random binary trees -- a survey
- A Motzkin filter in the Tamari lattice
- Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
- A catalanization map on the symmetric group
- Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
- On the loopless generation of binary tree sequences
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- The pruning-grafting lattice of binary trees
- Generating binary trees by Glivenko classes on Tamari lattices
- The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes
- Left distance binary tree representations
- On the generation of binary trees inA-order
- Generating binary trees in A-order from codewords defined on a four-letter alphabet
- Algebraic and combinatorial structures on pairs of twin binary trees
- Loop Free Generation ofK-Ary Trees
- A distance metric on binary trees using lattice-theoretic measures
- A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗
- Cubic realizations of Tamari interval lattices
- Optimal binary search trees
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- scientific article; zbMATH DE number 5171238 (Why is no real title available?)
- A loopless algorithm for generating binary tree sequences
- Three interacting families of Fuss-Catalan posets
- A direct algorithm for restricted rotation distance
- Loopless generation of \(k\)-ary tree sequences
- An efficient algorithm for estimating rotation distance between two binary trees
- Matchings In Three Catalan Lattices
- Efficient loopless generation of Gray codes for \(k\)-ary trees.
- On generating \(k\)-ary trees in computer representation
- Posets arising as 1-skeleta of simple polytopes, the nonrevisiting path conjecture, and poset topology
- scientific article; zbMATH DE number 3959452 (Why is no real title available?)
- Right-arm rotation distance between binary trees
- Geometric realizations of Tamari interval lattices via cubic coordinates
- Enumerating Ordered Trees Lexicographically
- Clean reversible simulations of ranking binary trees
- Effective splaying with restricted rotations
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- Gray codes for reflectable languages
- An algorithm to compute the möbius function of the rotation lattice of binary trees
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- Shellable nonpure complexes and posets. II
- Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
- scientific article; zbMATH DE number 7527483 (Why is no real title available?)
- Further bijections to pattern-avoiding valid hook configurations
- Sur la génération des arbres binaires par les B-suites
- Ranking and unranking bordered and unbordered words
This page was built for publication: Enumerating, Ranking and Unranking Binary Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3709911)
