Follow
Dominik Kempa
Dominik Kempa
Assistant Professor, Stony Brook University
Verified email at cs.stonybrook.edu - Homepage
Title
Cited by
Cited by
Year
At the roots of dictionary compression: string attractors
D Kempa, N Prezza
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
1292018
Linear time Lempel-Ziv factorization: Simple, fast, small
J Kärkkäinen, D Kempa, SJ Puglisi
Combinatorial Pattern Matching: 24th Annual Symposium, CPM 2013, Bad …, 2013
812013
Resolution of the burrows-wheeler transform conjecture
D Kempa, T Kociumaka
Communications of the ACM 65 (6), 91-98, 2022
712022
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
D Kempa, T Kociumaka
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
622019
Lightweight lempel-ziv parsing
J Kärkkäinen, D Kempa, SJ Puglisi
International Symposium on Experimental Algorithms, 139-150, 2013
512013
Lempel-Ziv factorization: Simple, fast, practical
D Kempa, SJ Puglisi
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and …, 2013
502013
Parallel external memory suffix sorting
J Kärkkäinen, D Kempa, SJ Puglisi
Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia …, 2015
472015
A subquadratic algorithm for minimum palindromic factorization
G Fici, T Gagie, J Kärkkäinen, D Kempa
Journal of Discrete Algorithms 28, 41-48, 2014
472014
Hybrid compression of bitvectors for the FM-index
J Kärkkäinen, D Kempa, SJ Puglisi
2014 Data Compression Conference, 302-311, 2014
442014
Lempel-Ziv parsing in external memory
J Kärkkäinen, D Kempa, SJ Puglisi
2014 Data Compression Conference, 153-162, 2014
372014
Engineering external memory induced suffix sorting
J Kärkkäinen, D Kempa, SJ Puglisi, B Zhukova
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and …, 2017
362017
Engineering a lightweight external memory suffix array construction algorithm
J Kärkkäinen, D Kempa
Mathematics in Computer Science 11, 137-149, 2017
352017
LZ-End parsing in compressed space
D Kempa, D Kosolobov
2017 Data Compression Conference (DCC), 350-359, 2017
302017
LCP array construction in external memory
J Kärkkäinen, D Kempa
Journal of Experimental Algorithmics (JEA) 21, 1-22, 2016
282016
Optimal construction of compressed indexes for highly repetitive texts
D Kempa
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
272019
Fixed block compression boosting in FM-indexes: Theory and practice
S Gog, J Kärkkäinen, D Kempa, M Petri, SJ Puglisi
Algorithmica 81, 1370-1391, 2019
252019
Diverse palindromic factorization is NP-complete
H Bannai, T Gagie, S Inenaga, J Kärkkäinen, D Kempa, M Piątkowski, ...
Developments in Language Theory: 19th International Conference, DLT 2015 …, 2015
232015
Hybrid indexing revisited
H Ferrada, D Kempa, SJ Puglisi
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and …, 2018
212018
Tighter bounds for the sum of irreducible LCP values
J Kärkkäinen, D Kempa, M Piatkowski
Theoretical Computer Science 656, 265-278, 2016
212016
On the size of Lempel-Ziv and Lyndon factorizations
J Kärkkäinen, D Kempa, Y Nakashima, SJ Puglisi, AM Shur
arXiv preprint arXiv:1611.08898, 2016
192016
The system can't perform the operation now. Try again later.
Articles 1–20