Optimal Computer Search Trees and Variable-Length Alphabetical Codes (Q5636753)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal Computer Search Trees and Variable-Length Alphabetical Codes |
scientific article; zbMATH DE number 3363424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal Computer Search Trees and Variable-Length Alphabetical Codes |
scientific article; zbMATH DE number 3363424 |
Statements
Optimal Computer Search Trees and Variable-Length Alphabetical Codes (English)
0 references
1971
0 references
algorithm
0 references
construction of alphabetic binary tree of minimum weighted path length
0 references
computer search procedure
0 references
0.8890554904937744
0 references
0.8638580441474915
0 references
0.860743522644043
0 references
0.860743522644043
0 references
