The evaluation of an alternative sum with applications to the analysis of some data structures (Q1111028)
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 4074509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The evaluation of an alternative sum with applications to the analysis of some data structures |
scientific article; zbMATH DE number 4074509 |
Statements
The evaluation of an alternative sum with applications to the analysis of some data structures (English)
0 references
1988
0 references
In the analysis of digital search trees and similar data structures like tries and Patricia tries there occur alternating sums the asymptotic analysis of which is nontrivial because the single terms are of almost equal size. The author shows how expressions of that type may be analyzed using Mellin transform techniques.
0 references
asymptotic enumeration
0 references
digital search trees
0 references
data structures
0 references
0.8016096353530884
0 references
0.8016096353530884
0 references
0.7783923745155334
0 references
