11 citations · 27 across the 7 of their papers we have counts for
7 papers
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…
Random Interval Graphs
Vasileios Iliopoulos
In this thesis, which is supervised by Dr. David Penman, we examine random interval graphs. Recall that such a graph is defined by letting b…
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…
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…
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…
The plastic number and its generalized polynomial
Vasileios Iliopoulos
The polynomial has a unique positive root known as plastic number, which is denoted by and is approximately equal to . In this note we study the zeroes…