Assembling approximately optimal binary search trees efficiently using arithmetics (Q989540)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Assembling approximately optimal binary search trees efficiently using arithmetics |
scientific article; zbMATH DE number 5773834
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Assembling approximately optimal binary search trees efficiently using arithmetics |
scientific article; zbMATH DE number 5773834 |
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
0.8452905416488647
0 references
0.8307643532752991
0 references
0.827272891998291
0 references
0.8262064456939697
0 references
