Average Case Analysis of Algorithms on Sequences

Wojciech Szpankowski · 2001

From the Publisher: While most algorithm designs are finalized toward worst case scenarios where they have to cope efficiently with unrealistic inputs, the average case solution is a probabilistic approach that allows for the possibility that a simple algorithm would suffice. This book provides a unique overview of the tools and techniques used in average case analysis of algorithms.

Read the paper · More papers on PaperTik