The Average Case Analysis of Algorithms: Mellin Transform Asymptotics
Abstract
This report is part of a series whose aim is to present in a synthetic way the major methods of «analytic combinatorics» needed in the average--case analysis of algorithms. It reviews the use of Mellin-Perron formulæand of Mellin transforms in this context. Applications include: divide-and-conquer recurrences, maxima finding, mergesort, digital trees and plane trees.