The evaluation of an alternative sum with applications to the analysis of some data structures (Q1111028): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(88)90137-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2079346522 / rank | |||
Normal rank | |||
Revision as of 01:25, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The evaluation of an alternative sum with applications to the analysis of some data structures |
scientific article |
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
