Pages that link to "Item:Q3709911"

The following pages link to Enumerating, Ranking and Unranking Binary Trees (Q3709911):

Displaying 50 items.

• On the loopless generation of binary tree sequences (Q293424) (← links)
• A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) (← links)
• On a subposet of the Tamari lattice (Q466873) (← links)
• Ranking and unranking of non-regular trees with a prescribed branching sequence (Q552163) (← links)
• Efficient lower and upper bounds of the diagonal-flip distance between triangulations (Q845849) (← links)
• A distance metric on binary trees using lattice-theoretic measures (Q910191) (← links)
• Gray codes for reflectable languages (Q976101) (← links)
• Weak associativity and restricted rotation (Q987810) (← links)
• Generating binary trees by Glivenko classes on Tamari lattices (Q1007536) (← links)
• Right-arm rotation distance between binary trees (Q1014416) (← links)
• A loopless algorithm for generating binary tree sequences (Q1182098) (← links)
• Loopless generation of \(k\)-ary tree sequences (Q1339380) (← links)
• On generating \(k\)-ary trees in computer representation (Q1603407) (← links)
• An efficient upper bound of the rotation distance of binary trees (Q1607028) (← links)
• Efficient loopless generation of Gray codes for \(k\)-ary trees. (Q1607068) (← links)
• Algebraic and combinatorial structures on pairs of twin binary trees (Q1758182) (← links)
• Generating random binary trees -- a survey (Q1818783) (← links)
• Further bijections to pattern-avoiding valid hook configurations (Q2020016) (← links)
• The Tamari block lattice: an order on saturated chains in the Tamari lattice (Q2144502) (← links)
• Catalan intervals and uniquely sorted permutations (Q2174949) (← links)
• Three interacting families of Fuss-Catalan posets (Q2199814) (← links)
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
• The \(\nu \)-Tamari lattice via \(\nu \)-trees, \( \nu \)-bracket vectors, and subword complexes (Q2288179) (← links)
• Cubic realizations of Tamari interval lattices (Q2306473) (← links)
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order (Q2321597) (← links)
• A Motzkin filter in the Tamari lattice (Q2342623) (← links)
• A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
• The pruning-grafting lattice of binary trees (Q2378517) (← links)
• A direct algorithm for restricted rotation distance (Q2390238) (← links)
• Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
• A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously (Q2867132) (← links)
• Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
• An algorithm to compute the möbius function of the rotation lattice of binary trees (Q3142268) (← links)
• Effective splaying with restricted rotations (Q3506250) (← links)
• Ranking and Unranking of Non-regular Trees (Q3792254) (← links)
• Generating trees with<i>n</i>nodes and<i>m</i>leaves (Q3805926) (← links)
• A decidable word problem without equivalent canonical term rewriting system (Q3816049) (← links)
• Coding Binary Trees by Words over an Alphabet with Four Letters (Q4024145) (← links)
• On the generation of binary trees in<i>A</i>-order (Q4254656) (← links)
• Generating binary trees in A-order from codewords defined on a four-letter alphabet (Q4321109) (← links)
• Shellable nonpure complexes and posets. II (Q4372583) (← links)
• A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
• Matchings In Three Catalan Lattices (Q4805933) (← links)
• Loop Free Generation of<i>K</i>-Ary Trees (Q4811716) (← links)
• A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗ (Q4820078) (← links)
• Three Fuss-Catalan posets in interaction and their associative algebras (Q5052177) (← links)
• (Q5076252) (← links)
• An efficient algorithm for estimating rotation distance between two binary trees (Q5312707) (← links)
• Optimal binary search trees (Q5906917) (← links)
• Left distance binary tree representations (Q5943012) (← links)