9 citations · 10 across the 4 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024★ 1 cited
Brief Announcement: Parallel Construction of Bumped Ribbon Retrieval
Matthias Becht, Hans-Peter Lehmann, Peter Sanders
A retrieval data structure stores a static function f : S -> {0,1}^r . For all x in S, it returns the r-bit value f(x), while for other inputs it may return an arbitrary result. Th…
cs.DS2020
Engineering Faster Sorters for Small Sets of Items
Timo Bingmann, Jasper Marianczuk, Peter Sanders
Sorting a set of items is a task that can be useful by itself or as a building block for more complex operations. That is why a lot of effort has been put into finding sorting algo…