Testing the optimality of alphabetic trees (Q1186607)
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 36848
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Testing the optimality of alphabetic trees |
scientific article; zbMATH DE number 36848 |
Statements
Testing the optimality of alphabetic trees (English)
0 references
28 June 1992
0 references
worst-case time complexity
0 references
trees
0 references
0.880669891834259
0 references
0.8775864243507385
0 references
0.8695449233055115
0 references
0.8533439636230469
0 references
