Pages that link to "Item:Q293424"
From MaRDI portal
The following pages link to On the loopless generation of binary tree sequences (Q293424):
Displaying 15 items.
- A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) (← links)
- Loop-free Gray code algorithms for the set of compositions (Q655198) (← links)
- Gray codes for reflectable languages (Q976101) (← links)
- Generating binary trees by Glivenko classes on Tamari lattices (Q1007536) (← links)
- On generating \(k\)-ary trees in computer representation (Q1603407) (← links)
- Efficient loopless generation of Gray codes for \(k\)-ary trees. (Q1607068) (← links)
- A loopless algorithm for generating the permutations of a multiset (Q1885026) (← links)
- Loop-free Gray code algorithm for the \textbf{e}-restricted growth functions (Q1944946) (← 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)
- A direct algorithm for restricted rotation distance (Q2390238) (← links)
- Constant time generation of derangements (Q2390248) (← links)
- Efficient generation of restricted growth words (Q2444851) (← 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)
