Deterministic Cache-Oblivious Funnelselect

The multiple-selection problem asks to find several elements of given ranks in a list of unordered numbers.

Our ESA 2023 paper presented the first I/O-optimal cache-oblivious algorithm for multiple selection, but our algorithm, Funnelselect, was randomized. In this paper, we present an alternative approach that yields a deterministic version of Funnelselect.