Ranking and unranking of B-trees
From MaRDI portal
Publication:4747523
DOI10.1016/0196-6774(83)90034-2zbMath0509.68056OpenAlexW2071064709MaRDI QIDQ4747523
No author found.
Publication date: 1983
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(83)90034-2
Trees (05C05) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (9)
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Ranking and unranking bordered and unbordered words ⋮ Ranking and Unranking of Non-regular Trees ⋮ A note on generating binary trees inA-order andB-order ⋮ Unranking of small combinations from large sets ⋮ On sampling representatives of relational schemas with a functional dependency ⋮ Generating binary trees of bounded height ⋮ On generating B-trees with constant average delay and in lexicographic order ⋮ Fast algorithms for genegrating integer partitions
This page was built for publication: Ranking and unranking of B-trees
