Pages that link to "Item:Q4142685"
From MaRDI portal
The following pages link to Generating Binary Trees Lexicographically (Q4142685):
Displaying 34 items.
- Ranking and unranking of non-regular trees with a prescribed branching sequence (Q552163) (← links)
- Sur la génération des arbres binaires par les B-suites (Q798328) (← links)
- Listing and counting subtrees of equal size of a binary tree (Q1055196) (← links)
- Permutation representation of k-ary trees (Q1062460) (← links)
- Generating binary trees of bounded height (Q1064071) (← links)
- The generation of random, binary unordered trees (Q1068492) (← links)
- Efficient generation of binary trees from inorder-postorder sequences (Q1099956) (← links)
- Generating ordered trees (Q1102758) (← links)
- Lexicographic generation of ordered trees (Q1133548) (← links)
- The average height of r-tuply rooted planted plane trees (Q1139055) (← links)
- Enumerations of ordered trees (Q1144044) (← links)
- A loopless algorithm for generating binary tree sequences (Q1182098) (← links)
- On generating B-trees with constant average delay and in lexicographic order (Q1313707) (← links)
- Average cost of Duval's algorithm for generating Lyndon words (Q1334678) (← links)
- An efficient upper bound of the rotation distance of binary trees (Q1607028) (← links)
- Encoding trees by linear recurrence sequences (Q1699391) (← links)
- A simple proof of a formula of Dershowitz and Zaks (Q1837685) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- Patterns in trees (Q2277475) (← links)
- The pruning-grafting lattice of binary trees (Q2378517) (← links)
- On the generation of<i>P</i>-sequences (Q3210910) (← links)
- On Level Numbers of <i>t</i>-Ary Trees (Q3658018) (← links)
- A note on generating binary trees in<i>A</i>-order and<i>B</i>-order (Q3802638) (← links)
- On the Average Shape of Binary Trees (Q3960130) (← links)
- On random and adaptive parallel generation of combinatorial objects (Q3989785) (← links)
- Coding Binary Trees by Words over an Alphabet with Four Letters (Q4024145) (← links)
- On the generation of binary trees from (0–1) codes (Q4256127) (← links)
- (Q4318151) (← links)
- Generating binary trees in A-order from codewords defined on a four-letter alphabet (Q4321109) (← links)
- A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
- Loop Free Generation of<i>K</i>-Ary Trees (Q4811716) (← links)
- Optimal binary search trees (Q5906917) (← links)
- Left distance binary tree representations (Q5943012) (← links)
- An explicit 16-stage Runge-Kutta method of order 10 discovered by numerical search (Q6559449) (← links)