Digital Search Trees Revisited (Q3751029)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3988729
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Digital Search Trees Revisited |
scientific article; zbMATH DE number 3988729 |
Statements
Digital Search Trees Revisited (English)
0 references
1986
0 references
analysis of algorithms
0 references
path length
0 references
asymptotic analysis
0 references
average case performance
0 references
digital search tree
0 references
0.8891622424125671
0 references
0.8698500394821167
0 references
0.8635187149047852
0 references
0.8616743087768555
0 references
0.8586064577102661
0 references
