Optimal binary search trees with costs depending on the access paths. (Q1401195): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:00, 31 January 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
