3 papers
cs.DS2021
Extending the Time Horizon: Efficient Public Transit Routing on Arbitrary-Length Timetables
Sascha Witt
We study the problem of computing all Pareto-optimal journeys in a public transit network regarding the two criteria of arrival time and number of transfers taken. In recent years,…
cs.DC2020
Engineering In-place (Shared-memory) Sorting Algorithms
Michael Axtmann, Sascha Witt, Daniel Ferizovic +1
We present sorting algorithms that represent the fastest known techniques for a wide range of input sizes, input distributions, data types, and machines. A part of the speed advant…
cs.DC2017
In-place Parallel Super Scalar Samplesort (IPSo)
Michael Axtmann, Sascha Witt, Daniel Ferizovic +1
We present a sorting algorithm that works in-place, executes in parallel, is cache-efficient, avoids branch-mispredictions, and performs work O(n log n) for arbitrary inputs with h…