32 citations · 32 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2025
On the Hardness Hierarchy for the Complexity in the Word RAM
Dominik Kempa, Tomasz Kociumaka
In this work, we study the relative hardness of fundamental problems with state-of-the-art word RAM algorithms that take time for instances described in …
cs.DS2019★ 32 cited
Resolution of the Burrows-Wheeler Transform Conjecture
Dominik Kempa, Tomasz Kociumaka
The Burrows-Wheeler Transform (BWT) is an invertible text transformation that permutes symbols of a text according to the lexicographical order of its suffixes. BWT is the main com…