License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-12893
URL: http://drops.dagstuhl.de/opus/volltexte/2007/1289/

Manthey, Bodo ; Tantau, Till

Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise

pdf-format:
Dokument 1.pdf (295 KB)


Abstract

While the height of binary search trees is linear in the worst case, their average height is logarithmic. We investigate what happens in between, i.e., when the randomness is limited, by analyzing the smoothed height of binary search trees: Randomly perturb a given (adversarial) sequence and then take the expected height of the binary search tree generated by the resulting sequence. As perturbation models, we consider partial permutations, where some elements are randomly permuted, and additive noise, where random numbers are added to the adversarial sequence. We prove tight bounds for the smoothed height of binary search trees under these models. We also obtain tight bounds for smoothed number of left-to-right maxima. Furthermore, we exploit the results obtained to get bounds for the smoothed number of comparisons that quicksort needs.

BibTeX - Entry

@InProceedings{manthey_et_al:DSP:2007:1289,
  author =	{Bodo Manthey and Till Tantau},
  title =	{Smoothed Analysis of Binary Search Trees and Quicksort Under Additive Noise},
  booktitle =	{Probabilistic Methods in the Design and Analysis of Algorithms},
  year =	{2007},
  editor =	{Martin Dietzfelbinger and Shang-Hua Teng and Eli Upfal and Berthold V{\"o}cking },
  number =	{07391},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2007/1289},
  annote =	{Keywords: Smoothed Analysis, Binary Search Trees, Quicksort, Left-to-right Maxima}
}

Keywords: Smoothed Analysis, Binary Search Trees, Quicksort, Left-to-right Maxima
Seminar: 07391 - Probabilistic Methods in the Design and Analysis of Algorithms
Issue date: 2007
Date of publication: 18.12.2007


DROPS-Home | Fulltext Search | Imprint Published by LZI