Dominik Kempa
Dominik Kempa
Подтвержден адрес электронной почты в домене berkeley.edu - Главная страница
Название
Процитировано
Процитировано
Год
Linear time Lempel-Ziv factorization: Simple, fast, small
J Kärkkäinen, D Kempa, SJ Puglisi
Annual Symposium on Combinatorial Pattern Matching, 189-200, 2013
562013
Lightweight lempel-ziv parsing
J Kärkkäinen, D Kempa, SJ Puglisi
International Symposium on Experimental Algorithms, 139-150, 2013
382013
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
362018
Parallel external memory suffix sorting
J Kärkkäinen, D Kempa, SJ Puglisi
Annual Symposium on Combinatorial Pattern Matching, 329-342, 2015
362015
Lempel-Ziv factorization: Simple, fast, practical
D Kempa, SJ Puglisi
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and …, 2013
342013
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
332014
Engineering a lightweight external memory suffix array construction algorithm
J Kärkkäinen, D Kempa
Mathematics in Computer Science 11 (2), 137-149, 2017
302017
Hybrid compression of bitvectors for the FM-index
J Kärkkäinen, D Kempa, SJ Puglisi
2014 Data Compression Conference, 302-311, 2014
282014
LCP array construction in external memory
J Kärkkäinen, D Kempa
Journal of Experimental Algorithmics (JEA) 21, 1-22, 2016
262016
Lempel-Ziv parsing in external memory
J Kärkkäinen, D Kempa, SJ Puglisi
2014 Data Compression Conference, 153-162, 2014
262014
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
192017
LZ-End parsing in compressed space
D Kempa, D Kosolobov
2017 Data Compression Conference (DCC), 350-359, 2017
152017
Faster external memory LCP array construction
J Kärkkäinen, D Kempa
24th Annual European Symposium on Algorithms (ESA 2016), 2016
142016
Diverse palindromic factorization is NP-complete
H Bannai, T Gagie, S Inenaga, J Kärkkäinen, D Kempa, M Piątkowski, ...
International Conference on Developments in Language Theory, 85-96, 2015
142015
Tighter bounds for the sum of irreducible LCP values
J Kärkkäinen, D Kempa, M Piatkowski
Theoretical Computer Science 656, 265-278, 2016
132016
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
122019
Optimal construction of compressed indexes for highly repetitive texts
D Kempa
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
112019
Slashing the time for BWT inversion
J Karkkainen, D Kempa, SJ Puglisi
2012 Data Compression Conference, 99-108, 2012
112012
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
102016
Faster Sparse Suffix Sorting}}
EW Mayr, N Portier
31st International Symposium on Theoretical Aspects of Computer Science …, 2014
92014
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20