Optimal binary search trees with costs depending on the access paths. (Q1401195): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0304-3975(02)00084-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2088407423 / rank | |||
Normal rank | |||
Latest revision as of 11:12, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal binary search trees with costs depending on the access paths. |
scientific article |
Statements
Optimal binary search trees with costs depending on the access paths. (English)
0 references
17 August 2003
0 references
Algorithms
0 references
Optimal binary search trees
0 references
Generating functions
0 references
