Optimal Computer Search Trees and Variable-Length Alphabetical Codes (Q5636753): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q56049308, #quickstatements; #temporary_batch_1711094041063 |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q56049308 / rank | |||
Normal rank | |||
Latest revision as of 14:52, 22 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
