| 2026 | ALENEX | Engineering Fast and Space-Efficient Recompression from SLP-Compressed Text. | Ankith Reddy Adudodla, Dominik Kempa |
| 2026 | ESA | Hardness of Frequency-Related Queries on Compressed Strings. | Rajat De, Dominik Kempa |
| 2026 | SODA | Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings. | Rajat De, Dominik Kempa |
| 2026 | SODA | Tight Lower Bounds for Central String Queries in Compressed Space. | Dominik Kempa, Tomasz Kociumaka |
| 2026 | SODA | Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries. | Dominik Kempa, Tomasz Kociumaka |
| 2025 | DCC | Word Break on SLP-Compressed Texts. | Rajat De, Dominik Kempa |
| 2025 | STOC | On the Hardness Hierarchy for the O(n√log n) Complexity in the Word RAM. | Dominik Kempa, Tomasz Kociumaka |
| 2024 | FOCS | Lempel-Ziv (LZ77) Factorization in Sublinear Time. | Dominik Kempa, Tomasz Kociumaka |
| 2024 | SODA | Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. | Rajat De, Dominik Kempa |
| 2023 | FOCS | Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. | Dominik Kempa, Tomasz Kociumaka |
| 2023 | SODA | Breaking the 𝒪( | Dominik Kempa, Tomasz Kociumaka |
| 2022 | SODA | An Upper Bound and Linear-Space Queries on the LZ-End Parsing. | Dominik Kempa, Barna Saha |
| 2022 | STOC | Dynamic suffix array with polylogarithmic queries and updates. | Dominik Kempa, Tomasz Kociumaka |
| 2021 | ESA | Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. | Dominik Kempa, Ben Langmead |
| 2020 | FOCS | Resolution of the Burrows-Wheeler Transform Conjecture. | Dominik Kempa, Tomasz Kociumaka |
| 2019 | SODA | Optimal Construction of Compressed Indexes for Highly Repetitive Texts. | Dominik Kempa |
| 2019 | STOC | String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. | Dominik Kempa, Tomasz Kociumaka |
| 2018 | ALENEX | Hybrid Indexing Revisited. | Hctor Ferrada, Dominik Kempa, Simon J. Puglisi |
| 2018 | ESA | String Attractors: Verification and Optimization. | Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg |
| 2018 | STOC | At the roots of dictionary compression: string attractors. | Dominik Kempa, Nicola Prezza |
| 2017 | ALENEX | Engineering External Memory Induced Suffix Sorting. | Juha Krkkinen, Dominik Kempa, Simon J. Puglisi, Bella Zhukova |
| 2017 | DCC | LZ-End Parsing in Compressed Space. | Dominik Kempa, Dmitry Kosolobov |
| 2017 | ESA | LZ-End Parsing in Linear Time. | Dominik Kempa, Dmitry Kosolobov |
| 2017 | STACS | On the Size of Lempel-Ziv and Lyndon Factorizations. | Juha Krkkinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur |
| 2016 | DCC | Faster, Minuter. | Simon Gog, Juha Krkkinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi |
| 2016 | ESA | Faster External Memory LCP Array Construction. | Juha Krkkinen, Dominik Kempa |
| 2016 | SPIRE | LCP Array Construction Using O(sort(n)) (or Less) I/Os. | Juha Krkkinen, Dominik Kempa |
| 2015 | CPM | Tighter Bounds for the Sum of Irreducible LCP Values. | Juha Krkkinen, Dominik Kempa, Marcin Piatkowski |
| 2015 | CPM | Parallel External Memory Suffix Sorting. | Juha Krkkinen, Dominik Kempa, Simon J. Puglisi |
| 2015 | DLT | Diverse Palindromic Factorization Is NP-complete. | Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Krkkinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto |
| 2014 | CPM | String Range Matching. | Juha Krkkinen, Dominik Kempa, Simon J. Puglisi |
| 2014 | DCC | Lempel-Ziv Parsing in External Memory. | Juha Krkkinen, Dominik Kempa, Simon J. Puglisi |
| 2014 | DCC | Hybrid Compression of Bitvectors for the FM-Index. | Juha Krkkinen, Dominik Kempa, Simon J. Puglisi |
| 2014 | STACS | Faster Sparse Suffix Sorting. | Tomohiro I, Juha Krkkinen, Dominik Kempa |
| 2013 | ALENEX | Lempel-Ziv factorization: Simple, fast, practical. | Dominik Kempa, Simon J. Puglisi |
| 2013 | CPM | Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. | Juha Krkkinen, Dominik Kempa, Simon J. Puglisi |
| 2012 | DCC | Slashing the Time for BWT Inversion. | Juha Krkkinen, Dominik Kempa, Simon J. Puglisi |
| 2012 | SPIRE | Grammar Precompression Speeds Up Burrows-Wheeler Compression. | Juha Krkkinen, Pekka Mikkola, Dominik Kempa |