3 citations · 3 across the 2 of their papers we have counts for
4 papers
Scalable Construction of Text Indexes
Timo Bingmann, Simon Gog, Florian Kurpicz
The suffix array is the key to efficient solutions for myriads of string processing problems in different applications domains, like data compression, data mining, or Bioinformatic…
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…
Practical Massively Parallel Sorting
Michael Axtmann, Timo Bingmann, Peter Sanders +1
Previous parallel sorting algorithms do not scale to the largest available machines, since they either have prohibitive communication volume or prohibitive critical path length. We…
Engineering Parallel String Sorting
Timo Bingmann, Andreas Eberle, Peter Sanders
We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and succes…