Optimal Computer Search Trees and Variable-Length Alphabetical Codes (Q5636753): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0121057 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2065954102 / rank | |||
Normal rank | |||
Revision as of 22:02, 19 March 2024
scientific article; zbMATH DE number 3363424
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
