Skip to content

Author

Dominik Kempa

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Aug 2026

Constant-Time Inverse Suffix Array Queries in Compact Space and Sublinear-Time Construction of Suffix Array Indexes

For a text $T\in[0..\sigma)^n$ with $2\leq\sigma\leq n$, its suffix array orders the suffix starting positions lexicographically, while its inverse suffix array maps each position to its suffix's rank. Since compressed suffix arrays and FM-indexes appeared in 2000, a central goal has been to support both queries in $O(...

Dominik Kempa, Tomasz Kociumaka · 1 citation
Preprint Aug 2026

Cell-Probe Lower Bounds and Complexity-Preserving Reductions for Suffix Array Queries

The first nontrivial time-space lower bound for suffix-array queries is given, answering the 25-year-old question of Grossi and Vitter, and exact complexity-preserving equivalences between suffix-array access and simpler prefix queries on short strings are given.

Dominik Kempa, Tomasz Kociumaka · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.