Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (Q2274095)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7107296
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order |
scientific article; zbMATH DE number 7107296 |
Statements
Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order (English)
0 references
19 September 2019
0 references
binary trees
0 references
left-child sequences
0 references
generation algorithms
0 references
ranking/unranking algorithms
0 references
lexicographic order
0 references
amortized cost
0 references
0 references
0 references
0 references
0.9758994579315186
0 references
0.9504090547561646
0 references
0.8240725994110107
0 references
0.8232702612876892
0 references
0.8232702612876892
0 references
