11 citations · 27 across the 7 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2015★ 4 cited
Dual pivot Quicksort
Vasileios Iliopoulos, David B. Penman
In this paper, we analyse the dual pivot Quicksort, a variant of the standard Quicksort algorithm, in which two pivots are used for the partitioning of the array. We are solving re…
cs.DS2015★ 4 cited
The Quicksort algorithm and related topics
Vasileios Iliopoulos
Sorting algorithms have attracted a great deal of attention and study, as they have numerous applications to Mathematics, Computer Science and related fields. In this thesis, we fi…
cs.DS2014★ 5 cited
A note on multipivot Quicksort
Vasileios Iliopoulos
We analyse a generalisation of the Quicksort algorithm, where k uniformly at random chosen pivots are used for partitioning an array of n distinct keys. Specifically, the expected…