3 citations · 6 across the 6 of their papers we have counts for
11 papers
Communication-Efficient String Sorting
Timo Bingmann, Peter Sanders, Matthias Schimek
There has been surprisingly little work on algorithms for sorting strings on distributed-memory parallel machines. We develop efficient algorithms for this problem based on the mul…
COBS: a Compact Bit-Sliced Signature Index
Timo Bingmann, Phelim Bradley, Florian Gauger +1
We present COBS, a COmpact Bit-sliced Signature index, which is a cross-over between an inverted index and Bloom filters. Our target application is to index -mers of DNA samples…
Scalable String and Suffix Sorting: Algorithms, Techniques, and Tools
Timo Bingmann
This dissertation focuses on two fundamental sorting problems: string sorting and suffix sorting. The first part considers parallel string sorting on shared-memory multi-core machi…
Proving Equivalence Between Imperative and MapReduce Implementations Using Program Transformations
Bernhard Beckert, Timo Bingmann, Moritz Kiefer +3
Distributed programs are often formulated in popular functional frameworks like MapReduce, Spark and Thrill, but writing efficient algorithms for such frameworks is usually a non-t…
Relational Equivalence Proofs Between Imperative and MapReduce Algorithms
Bernhard Beckert, Timo Bingmann, Moritz Kiefer +3
MapReduce frameworks are widely used for the implementation of distributed algorithms. However, translating imperative algorithms into these frameworks requires significant structu…
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…