pdfformat: 

@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 ShangHua Teng and Eli Upfal and Berthold V{\"o}cking }, number = {07391}, series = {Dagstuhl Seminar Proceedings}, ISSN = {18624405}, 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, Lefttoright Maxima} }
Keywords:  Smoothed Analysis, Binary Search Trees, Quicksort, Lefttoright Maxima  
Seminar:  07391  Probabilistic Methods in the Design and Analysis of Algorithms  
Issue date:  2007  
Date of publication:  18.12.2007 