11 citations · 22 across the 5 of their papers we have counts for
12 papers
Theory Meets Practice for Bit Vectors Supporting Rank and Select
Florian Kurpicz, Niccolò Rigi-Luperti, Peter Sanders
Bit vectors with support for fast rank and select are a fundamental building block for compressed data structures. We close a gap between theory and practice by analyzing an import…
Fast and Lightweight Distributed Suffix Array Construction -- First Results
Manuel Haag, Florian Kurpicz, Peter Sanders +1
We present first algorithmic ideas for a practical and lightweight adaption of the DCX suffix array construction algorithm [Sanders et al., 2003] to the distributed-memory setting.…
Scalable Distributed String Sorting
Florian Kurpicz, Pascal Mehnert, Peter Sanders +1
String sorting is an important part of tasks such as building index data structures. Unfortunately, current string sorting algorithms do not scale to massively parallel distributed…
KaMPIng: Flexible and (Near) Zero-Overhead C++ Bindings for MPI
Tim Niklas Uhl, Matthias Schimek, Lukas Hübner +4
The Message-Passing Interface (MPI) and C++ form the backbone of high-performance computing, but MPI only provides C and Fortran bindings. While this offers great language interope…
High Performance Construction of RecSplit Based Minimal Perfect Hash Functions
Dominik Bez, Florian Kurpicz, Hans-Peter Lehmann +1
A minimal perfect hash function (MPHF) bijectively maps a set S of objects to the first |S| integers. It can be used as a building block in databases and data compression. RecSplit…
PaCHash: Packed and Compressed Hash Tables
Florian Kurpicz, Hans-Peter Lehmann, Peter Sanders
We introduce PaCHash, a hash table that stores its objects contiguously in an array without intervening space, even if the objects have variable size. In particular, each object ca…
Space Efficient Construction of Lyndon Arrays in Linear Time
Philip Bille, Jonas Ellert, Johannes Fischer +4
We present the first linear time algorithm to construct the -bit version of the Lyndon array for a string of length using only bits of working space. A simpler varia…
Dismantling DivSufSort
Johannes Fischer, Florian Kurpicz
We give the first concise description of the fastest known suffix sorting algorithm in main memory, the DivSufSort by Yuta Mori. We then present an extension that also computes the…
Simple, Fast and Lightweight Parallel Wavelet Tree Construction
Johannes Fischer, Florian Kurpicz, Marvin Löbel
The wavelet tree (Grossi et al. [SODA, 2003]) and wavelet matrix (Claude et al. [Inf. Syst., 47:15--32, 2015]) are compact indices for texts over an alphabet that support r…
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…
Engineering a Distributed Full-Text Index
Johannes Fischer, Florian Kurpicz, Peter Sanders
We present a distributed full-text index for big data applications in a distributed environment. Our index can answer different types of pattern matching queries (existential, coun…
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
Johannes Fischer, Dominik Köppl, Florian Kurpicz
We present parallel algorithms for exact and approximate pattern matching with suffix arrays, using a CREW-PRAM with processors. Given a static text of length , we first sho…