Algorithms Non - Lecture 9 : Tail Inequalities

  • Mark Twain
  • Published 2009

Abstract

The simple recursive structure of skip lists made it relatively easy to derive an upper bound on the expected worst-case search time, by way of a stronger high-probability upper bound on the worst-case search time. We can prove similar results for treaps, but because of the more complex recursive structure, we need slightly more sophisticated probabilistic tools. These tools are usually called tail inequalities; intuitively, they bound the probability that a random variable with a bell-shaped distribution takes a value in the tails of the distribution, far away from the mean.

Cite this paper

@inproceedings{Twain2009AlgorithmsN, title={Algorithms Non - Lecture 9 : Tail Inequalities}, author={Mark Twain}, year={2009} }