![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/mfcs/MantheyT08
@inproceedings{DBLP:conf/mfcs/MantheyT08, author = {Bodo Manthey and Till Tantau}, editor = {Edward Ochmanski and Jerzy Tyszkiewicz}, title = {Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise}, booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5162}, pages = {467--478}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85238-4\_38}, doi = {10.1007/978-3-540-85238-4\_38}, timestamp = {Tue, 14 May 2019 10:00:37 +0200}, biburl = {https://dblp.org/rec/conf/mfcs/MantheyT08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.