Pages that link to "Item:Q1182098"

The following pages link to A loopless algorithm for generating binary tree sequences (Q1182098):

Displaying 18 items.

• Shifts and loopless generation of \(k\)-ary trees (Q293252) (← links)
• On the loopless generation of binary tree sequences (Q293424) (← links)
• A loopless algorithm for generating multiple binary tree sequences simultaneously (Q300220) (← links)
• On generating B-trees with constant average delay and in lexicographic order (Q1313707) (← links)
• Enumeration of binary trees (Q1332756) (← links)
• Loopless generation of \(k\)-ary tree sequences (Q1339380) (← links)
• On generating \(k\)-ary trees in computer representation (Q1603407) (← links)
• Efficient loopless generation of Gray codes for \(k\)-ary trees. (Q1607068) (← links)
• A shift Gray code for fixed-content Łukasiewicz words (Q2169973) (← links)
• Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095) (← links)
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order (Q2321597) (← 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)
• Fast algorithms for genegrating integer partitions (Q4236115) (← links)
• A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order (Q4632217) (← links)
• A-order generation of k-ary trees with a 4k–4 letter alphabet (Q4718611) (← links)
• Loop Free Generation of<i>K</i>-Ary Trees (Q4811716) (← links)
• Optimal binary search trees (Q5906917) (← links)