10 citations · 34 across the 21 of their papers we have counts for
4 papers · 1 filter
QuickXsort - A Fast Sorting Scheme in Theory and Practice
Stefan Edelkamp, Armin Weiß, Sebastian Wild
QuickXsort is a highly efficient in-place sequential sorting scheme that mixes Hoare's Quicksort algorithm with X, where X can be chosen from a wider range of other known sorting a…
Worst-Case Efficient Sorting with QuickMergesort
Stefan Edelkamp, Armin Weiß
The two most prominent solutions for the sorting problem are Quicksort and Mergesort. While Quicksort is very fast on average, Mergesort additionally gives worst-case guarantees, b…
QuickMergesort: Practically Efficient Constant-Factor Optimal Sorting
Stefan Edelkamp, Armin Weiß
We consider the fundamental problem of internally sorting a sequence of elements. In its best theoretical setting QuickMergesort, a combination Quicksort with Mergesort with a…
The isomorphism problem for finite extensions of free groups is in PSPACE
Géraud Sénizergues, Armin Weiß
We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group , compute a finite graph of groups w…