Sample sort, a generalization of quicksort that partitions the input into many pieces, is known as the best practical comparison based sorting algorithm for distributed memory para...
This paper describes a more efficient paired comparison method that reduces the number of trials necessary for converting a table of paired comparisons into scalar data. Instead o...