4 citations · 5 across the 3 of their papers we have counts for
3 papers
math.CO2016★ 1 cited
Linear Extensions and Comparable Pairs in Partial Orders
Colin McDiarmid, David Penman, Vasileios Iliopoulos
We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also…
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…
math.PR2010
Variance of the number of Comparisons of Randomized Quicksort
Vasileios Iliopoulos, David Penman
This paper gives a straightforward self-contained proof of the formula for the variance of the number of comparisons used by the Quicksort sorting algorithm when pivots are chosen…