Dominik Kempa

Publication Activity (10 Years)

Years Active: 2012-2024
Publications (10 Years): 42

Top Topics

Compressed Data

Memory Efficient

External Memory

Top Venues

Publications

Rajat De, Dominik Kempa
Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. SODA (2024)
Dominik Kempa, Tomasz Kociumaka
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. CoRR (2023)
Dominik Kempa, Tomasz Kociumaka
)-Barrier in the Construction of Compressed Suffix Arrays and Suffix Trees. SODA (2023)
Rajat De, Dominik Kempa
Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data. CoRR (2023)
Dominik Kempa, Tomasz Kociumaka
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space. FOCS (2023)
Dominik Kempa, Tomasz Kociumaka
Resolution of the burrows-wheeler transform conjecture. Commun. ACM 65 (6) (2022)
Dominik Kempa, Tomasz Kociumaka
Dynamic suffix array with polylogarithmic queries and updates. STOC (2022)
Dominik Kempa, Tomasz Kociumaka
Dynamic Suffix Array with Polylogarithmic Queries and Updates. CoRR (2022)
Dominik Kempa, Barna Saha
An Upper Bound and Linear-Space Queries on the LZ-End Parsing. SODA (2022)
Dominik Kempa, Ben Langmead
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. CoRR (2021)
Dominik Kempa, Ben Langmead
Fast and Space-Efficient Construction of AVL Grammars from the LZ77 Parsing. ESA (2021)
Dominik Kempa, Tomasz Kociumaka
Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays. CoRR (2021)
Dominik Kempa, Tomasz Kociumaka
Resolution of the Burrows-Wheeler Transform Conjecture. FOCS (2020)
Dominik Kempa, Tomasz Kociumaka
Resolution of the Burrows-Wheeler Transform Conjecture. CoRR (2019)
Dominik Kempa, Tomasz Kociumaka
String Synchronizing Sets: Sublinear-Time BWT Construction and Optimal LCE Data Structure. CoRR (2019)
Juha Kärkkäinen, Dominik Kempa
Better External Memory LCP Array Construction. ACM J. Exp. Algorithmics 24 (1) (2019)
Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi
Fixed Block Compression Boosting in FM-Indexes: Theory and Practice. Algorithmica 81 (4) (2019)
Dominik Kempa, Tomasz Kociumaka
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure. STOC (2019)
Dominik Kempa
Optimal Construction of Compressed Indexes for Highly Repetitive Texts. SODA (2019)
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Shiho Sugimoto
Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. 29 (2) (2018)
Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg
String Attractors: Verification and Optimization. CoRR (2018)
Héctor Ferrada, Dominik Kempa, Simon J. Puglisi
Hybrid Indexing Revisited. ALENEX (2018)
Dominik Kempa, Nicola Prezza
At the roots of dictionary compression: string attractors. STOC (2018)
Dominik Kempa, Alberto Policriti, Nicola Prezza, Eva Rotenberg
String Attractors: Verification and Optimization. ESA (2018)
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
On the Size of Lempel-Ziv and Lyndon Factorizations. STACS (2017)
Dominik Kempa, Dmitry Kosolobov
LZ-End Parsing in Compressed Space. DCC (2017)
Juha Kärkkäinen, Dominik Kempa
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet. SEA (2017)
Dominik Kempa, Dmitry Kosolobov
LZ-End Parsing in Linear Time. ESA (2017)
Dominik Kempa
Closing in on Time and Space Optimal Construction of Compressed Indexes. CoRR (2017)
Dominik Kempa, Nicola Prezza
At the Roots of Dictionary Compression: String Attractors. CoRR (2017)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi, Bella Zhukova
Engineering External Memory Induced Suffix Sorting. ALENEX (2017)
Juha Kärkkäinen, Dominik Kempa
Engineering a Lightweight External Memory Suffix Array Construction Algorithm. Math. Comput. Sci. 11 (2) (2017)
Juha Kärkkäinen, Dominik Kempa
Faster External Memory LCP Array Construction. ESA (2016)
Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Lempel-Ziv Decoding in External Memory. SEA (2016)
Dominik Kempa, Dmitry Kosolobov
LZ-End Parsing in Compressed Space. CoRR (2016)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Lazy Lempel-Ziv Factorization Algorithms. ACM J. Exp. Algorithmics 21 (1) (2016)
Juha Kärkkäinen, Dominik Kempa
LCP Array Construction in External Memory. ACM J. Exp. Algorithmics 21 (1) (2016)
Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur
On the Size of Lempel-Ziv and Lyndon Factorizations. CoRR (2016)
Juha Kärkkäinen, Dominik Kempa
LCP Array Construction Using O(sort(n)) (or Less) I/Os. SPIRE (2016)
Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski
Tighter bounds for the sum of irreducible LCP values. Theor. Comput. Sci. 656 (2016)
Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Lempel-Ziv Decoding in External Memory. CoRR (2016)
Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi
Faster, Minuter. DCC (2016)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Parallel External Memory Suffix Sorting. CPM (2015)
Hideo Bannai, Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto
Diverse Palindromic Factorization Is NP-complete. DLT (2015)
Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto
Diverse Palindromic Factorization is NP-Complete. CoRR (2015)
Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski
Tighter Bounds for the Sum of Irreducible LCP Values. CPM (2015)
Tomohiro I, Juha Kärkkäinen, Dominik Kempa
Faster Sparse Suffix Sorting. STACS (2014)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Lempel-Ziv Parsing in External Memory. DCC (2014)
Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa
A Subquadratic Algorithm for Minimum Palindromic Factorization. CoRR (2014)
Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa
A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms 28 (2014)
Juha Kärkkäinen, Dominik Kempa
Engineering a Lightweight External Memory Suffix Array Construction Algorithm. ICABD (2014)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Hybrid Compression of Bitvectors for the FM-Index. DCC (2014)
Juha Kärkkäinen, Dominik Kempa
LCP Array Construction in External Memory. SEA (2014)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
String Range Matching. CPM (2014)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Lightweight Lempel-Ziv Parsing. SEA (2013)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Crochemore's String Matching Algorithm: Simplification, Extensions, Applications. Stringology (2013)
Dominik Kempa, Simon J. Puglisi
Lempel-Ziv factorization: Simple, fast, practical. ALENEX (2013)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. CPM (2013)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Lightweight Lempel-Ziv Parsing CoRR (2013)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Lempel-Ziv Parsing in External Memory. CoRR (2013)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Slashing the Time for BWT Inversion. DCC (2012)
Juha Kärkkäinen, Pekka Mikkola, Dominik Kempa
Grammar Precompression Speeds Up Burrows-Wheeler Compression. SPIRE (2012)
Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small CoRR (2012)