activity
20122023
most citedContext-Free Groups and Their Structure Trees

10 citations · 34 across the 21 of their papers we have counts for

collaborators
Showing 2013 · cs.DSShow all

1 paper · 2 filters

cs.DS2013

QuickXsort: Efficient Sorting with n log n - 1.399n +o(n) Comparisons on Average

Stefan Edelkamp, Armin Weiß

In this paper we generalize the idea of QuickHeapsort leading to the notion of QuickXsort. Given some external sorting algorithm X, QuickXsort yields an internal sorting algorithm…