107 citations · 409 across the 18 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021★ 11 cited
Breaking the -Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees
Dominik Kempa, Tomasz Kociumaka
The suffix array and the suffix tree are the two most fundamental data structures for string processing. For a length- text, however, they use bits of space, which…
cs.DS2021★ 1 cited
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing
Dominik Kempa, Ben Langmead
Grammar compression is, next to Lempel-Ziv (LZ77) and run-length Burrows-Wheeler transform (RLBWT), one of the most flexible approaches to representing and processing highly compre…