The following pages link to Ranking and unranking of B-trees (Q4747523):
Displaying 9 items.
- Unranking of small combinations from large sets (Q473209) (← links)
- Generating binary trees of bounded height (Q1064071) (← links)
- On generating B-trees with constant average delay and in lexicographic order (Q1313707) (← links)
- On sampling representatives of relational schemas with a functional dependency (Q2103897) (← links)
- Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences (Q2397155) (← links)
- Ranking and Unranking of Non-regular Trees (Q3792254) (← links)
- A note on generating binary trees in<i>A</i>-order and<i>B</i>-order (Q3802638) (← links)
- Fast algorithms for genegrating integer partitions (Q4236115) (← links)
- Ranking and unranking bordered and unbordered words (Q6121434) (← links)
