Further results on digital search trees (Q1110340)
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 4072400
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Further results on digital search trees |
scientific article; zbMATH DE number 4072400 |
Statements
Further results on digital search trees (English)
0 references
1988
0 references
The variance of the internal path length of digital search trees is analysed within a model where we start from certain abstract averaging trees. The asymptotic evaluation is obtained via complex residue calculus.
0 references
asymptotic analysis of generating functions
0 references
internal path length
0 references
digital search trees
0 references
0.9135993719100952
0 references
0.9087899327278136
0 references
0.8574826121330261
0 references
