The evaluation of an alternative sum with applications to the analysis of some data structures (Q1111028): Difference between revisions

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.