Slashing the Time for BWT Inversion. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (DCC, 2012)

Grammar Precompression Speeds Up Burrows-Wheeler Compression. - Juha Kärkkäinen; Pekka Mikkola; Dominik Kempa (SPIRE, 2012)

Lempel-Ziv factorization: Simple, fast, practical. - Dominik Kempa; Simon J. Puglisi (ALENEX, 2013)

Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (CPM, 2013)

Crochemore's String Matching Algorithm: Simplification, Extensions, Applications. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (Stringology, 2013)

Lightweight Lempel-Ziv Parsing. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (SEA, 2013)

String Range Matching. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (CPM, 2014)

Lempel-Ziv Parsing in External Memory. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (DCC, 2014)

Hybrid Compression of Bitvectors for the FM-Index. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (DCC, 2014)

Faster Sparse Suffix Sorting. - Tomohiro I; Juha Kärkkäinen; Dominik Kempa (STACS, 2014)

A subquadratic algorithm for minimum palindromic factorization. - Gabriele Fici; Travis Gagie; Juha Kärkkäinen; Dominik Kempa (J. Discrete Algorithms, 2014)

Parallel External Memory Suffix Sorting. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (CPM, 2015)

Diverse Palindromic Factorization Is NP-complete. - Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto (DLT, 2015)

Diverse Palindromic Factorization is NP-Complete. - Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto (CoRR, 2015)

Efficient Construction of Fundamental Data Structures in Large-Scale Text Indexing. - Dominik Kempa (2015)

Faster, Minuter. - Simon Gog; Juha Kärkkäinen; Dominik Kempa; Matthias Petri; Simon J. Puglisi (DCC, 2016)

Faster External Memory LCP Array Construction. - Juha Kärkkäinen; Dominik Kempa (ESA, 2016)

LCP Array Construction Using O(sort(n)) (or Less) I/Os. - Juha Kärkkäinen; Dominik Kempa (SPIRE, 2016)

Lempel-Ziv Decoding in External Memory. - Djamal Belazzougui; Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (SEA, 2016)

LCP Array Construction in External Memory. - Juha Kärkkäinen; Dominik Kempa (ACM J. Exp. Algorithmics, 2016)

Lazy Lempel-Ziv Factorization Algorithms. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (ACM J. Exp. Algorithmics, 2016)

Tighter bounds for the sum of irreducible LCP values. - Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski (Theor. Comput. Sci., 2016)

Engineering External Memory Induced Suffix Sorting. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi; Bella Zhukova (ALENEX, 2017)

LZ-End Parsing in Compressed Space. - Dominik Kempa; Dmitry Kosolobov (DCC, 2017)

LZ-End Parsing in Linear Time. - Dominik Kempa; Dmitry Kosolobov (ESA, 2017)

On the Size of Lempel-Ziv and Lyndon Factorizations. - Juha Kärkkäinen; Dominik Kempa; Yuto Nakashima 001; Simon J. Puglisi; Arseny M. Shur (STACS, 2017)

Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet. - Juha Kärkkäinen; Dominik Kempa (SEA, 2017)

Closing in on Time and Space Optimal Construction of Compressed Indexes. - Dominik Kempa (CoRR, 2017)

Engineering a Lightweight External Memory Suffix Array Construction Algorithm. - Juha Kärkkäinen; Dominik Kempa (Math. Comput. Sci., 2017)

Hybrid Indexing Revisited. - Héctor Ferrada; Dominik Kempa; Simon J. Puglisi (ALENEX, 2018)

String Attractors: Verification and Optimization. - Dominik Kempa; Alberto Policriti; Nicola Prezza; Eva Rotenberg (ESA, 2018)

At the roots of dictionary compression: string attractors. - Dominik Kempa; Nicola Prezza (STOC, 2018)

Diverse Palindromic Factorization is NP-Complete. - Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Shiho Sugimoto (Int. J. Found. Comput. Sci., 2018)

Optimal Construction of Compressed Indexes for Highly Repetitive Texts. - Dominik Kempa (SODA, 2019)

String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. - Dominik Kempa; Tomasz Kociumaka (STOC, 2019)

Fixed Block Compression Boosting in FM-Indexes: Theory and Practice. - Simon Gog; Juha Kärkkäinen; Dominik Kempa; Matthias Petri; Simon J. Puglisi (Algorithmica, 2019)

Better External Memory LCP Array Construction. - Juha Kärkkäinen; Dominik Kempa (ACM J. Exp. Algorithmics, 2019)

Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. - Dominik Kempa; Ben Langmead (ESA, 2021)

Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays. - Dominik Kempa; Tomasz Kociumaka (CoRR, 2021)

An Upper Bound and Linear-Space Queries on the LZ-End Parsing. - Dominik Kempa; Barna Saha (SODA, 2022)

Dynamic suffix array with polylogarithmic queries and updates. - Dominik Kempa; Tomasz Kociumaka (STOC, 2022)

Resolution of the burrows-wheeler transform conjecture. - Dominik Kempa; Tomasz Kociumaka (Commun. ACM, 2022)

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. - Dominik Kempa; Tomasz Kociumaka (FOCS, 2023)

Breaking the 𝒪(n)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. - Dominik Kempa; Tomasz Kociumaka (SODA, 2023)

Lempel-Ziv (LZ77) Factorization in Sublinear Time. - Dominik Kempa; Tomasz Kociumaka (FOCS, 2024)

Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. - Rajat De; Dominik Kempa (SODA, 2024)

Word Break on SLP-Compressed Texts. - Rajat De; Dominik Kempa (DCC, 2025)

On the Hardness Hierarchy for the O(n√log n) Complexity in the Word RAM. - Dominik Kempa; Tomasz Kociumaka (STOC, 2025)

Engineering Fast and Space-Efficient Recompression from SLP-Compressed Text. - Ankith Reddy Adudodla; Dominik Kempa (CoRR, 2025)