Ranking and unranking of B-trees
- 31 March 1983
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 4 (1) , 51-60
- https://doi.org/10.1016/0196-6774(83)90034-2
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Constant Time Generation of Rooted TreesSIAM Journal on Computing, 1980
- On the Generation of Binary TreesJournal of the ACM, 1980
- A Note on Enumerating Binary TreesJournal of the ACM, 1980
- Ranking and Listing Algorithms for k-Ary TreesSIAM Journal on Computing, 1978
- Generating t-Ary Trees LexicographicallySIAM Journal on Computing, 1978
- Generation of Binary Trees from Ballot SequencesJournal of the ACM, 1978
- Generating Binary Trees LexicographicallySIAM Journal on Computing, 1977
- A unified setting for sequencing, ranking, and selection algorithms for combinatorial objectsAdvances in Mathematics, 1977
- A numbering system for binary treesCommunications of the ACM, 1977
- Organization and maintenance of large ordered indexesActa Informatica, 1972