This is the first thorough analysis of dual-pivot Quicksort and was my first conference paper ever.
It won the best paper award at ESA 2012, and is cited in the Algorithms 4th edition by Robert Sedgewick and Kevin Wayne, see Chapter 2.
Relation to Other Papers
- the analysis of Quicksort using Insertionsort for inputs of size at most $M$,
- and the convergence of costs in distribution via the contraction method.
This paper is accessible to all computer scientists.