A subquadratic algorithm for constructing approximately optimal binary search trees (Q3795240): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2067704863 / rank | |||
Normal rank | |||
Latest revision as of 23:29, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A subquadratic algorithm for constructing approximately optimal binary search trees |
scientific article |
Statements
A subquadratic algorithm for constructing approximately optimal binary search trees (English)
0 references
1987
0 references
optimal binary search trees
0 references
