On Smoothed Analysis of Quicksort and Hoare’s Find
From MaRDI portal
Publication:5323060
DOI10.1007/978-3-642-02882-3_17zbMath1248.68580OpenAlexW2484486082MaRDI QIDQ5323060
Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi, Mahmoud Fouz
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://elib.uni-stuttgart.de/handle/11682/6940
Related Items
Uses Software
Cites Work
- Unnamed Item
- The analysis of Quicksort programs
- Smoothed analysis of binary search trees
- On smoothed analysis of quicksort and Hoare's find
- Analysis of Hoare's FIND algorithm with Median-of-three partition
- The Worst Case Permutation for Median-of-Three Quicksort
- Smoothed analysis of algorithms
- Smoothed Analysis of Binary Search Trees and Quicksort under Additive Noise
- Implementing Quicksort programs
- Comparisons in Hoare's Find Algorithm
- Mathematical Foundations of Computer Science 2003
- Algorithms - ESA 2003