The following pages link to A Survey on Binary Tree Codings (Q2740922):
Displaying 9 items.
- An Eades-McKay algorithm for well-formed parentheses strings (Q293461) (← links)
- Rational languages defined with a non-associative concatenation (Q1575941) (← links)
- Generating random binary trees -- a survey (Q1818783) (← links)
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations (Q2369000) (← links)
- Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order (Q2958342) (← links)
- Coding Binary Trees by Words over an Alphabet with Four Letters (Q4024145) (← 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)
