11 citations · 21 across the 3 of their papers we have counts for
6 papers · 1 filter
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…
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…
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…