Assembling approximately optimal binary search trees efficiently using arithmetics (Q989540)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Assembling approximately optimal binary search trees efficiently using arithmetics |
scientific article |
Statements
Assembling approximately optimal binary search trees efficiently using arithmetics (English)
0 references
20 August 2010
0 references
data structures
0 references
binary search trees
0 references
entropy bounds
0 references
i/o cost models
0 references
approximation algorithms
0 references
