9 citations · 10 across the 4 of their papers we have counts for
4 papers
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…
Brief Announcement: Distributed Unconstrained Local Search for Multilevel Graph Partitioning
Peter Sanders, Daniel Seemaier
Partitioning a graph into blocks of roughly equal weight while cutting only few edges is a fundamental problem in computer science with numerous practical applications. While share…
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…
Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++
Timo Bingmann, Michael Axtmann, Emanuel Jöbstl +7
We present the design and a first performance evaluation of Thrill -- a prototype of a general purpose big data processing framework with a convenient data-flow style programming i…