Dominik Kempa
Dominik Kempa
Department of Computer Science, University of Warwick
Подтвержден адрес электронной почты в домене warwick.ac.uk - Главная страница
НазваниеПроцитированоГод
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
542013
Lightweight lempel-ziv parsing
J Kärkkäinen, D Kempa, SJ Puglisi
International Symposium on Experimental Algorithms, 139-150, 2013
382013
Parallel external memory suffix sorting
J Kärkkäinen, D Kempa, SJ Puglisi
Annual Symposium on Combinatorial Pattern Matching, 329-342, 2015
322015
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
322014
Lempel-Ziv factorization: Simple, fast, practical
D Kempa, SJ Puglisi
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and …, 2013
322013
Engineering a lightweight external memory suffix array construction algorithm
J Kärkkäinen, D Kempa
Mathematics in Computer Science 11 (2), 137-149, 2017
262017
LCP array construction in external memory
J Kärkkäinen, D Kempa
Journal of Experimental Algorithmics (JEA) 21, 1.7, 2016
252016
Hybrid compression of bitvectors for the FM-index
J Kärkkäinen, D Kempa, SJ Puglisi
2014 Data Compression Conference, 302-311, 2014
242014
Lempel-Ziv parsing in external memory
J Kärkkäinen, D Kempa, SJ Puglisi
2014 Data Compression Conference, 153-162, 2014
232014
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
222018
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
172017
LZ-End parsing in compressed space
D Kempa, D Kosolobov
2017 Data Compression Conference (DCC), 350-359, 2017
122017
Faster external memory LCP array construction
J Kärkkäinen, D Kempa
24th Annual European Symposium on Algorithms (ESA 2016), 2016
122016
Slashing the time for BWT inversion
J Karkkainen, D Kempa, SJ Puglisi
2012 Data Compression Conference, 99-108, 2012
122012
Tighter bounds for the sum of irreducible LCP values
J Kärkkäinen, D Kempa, M Piatkowski
Theoretical Computer Science 656, 265-278, 2016
112016
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
92015
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
82016
LCP array construction using O (sort (n))(or less) I/Os
J Kärkkäinen, D Kempa
International Symposium on String Processing and Information Retrieval, 204-217, 2016
82016
Faster, minuter
S Gog, J Kärkkäinen, D Kempa, M Petri, SJ Puglisi
2016 Data Compression Conference (DCC), 53-62, 2016
82016
Hybrid indexing revisited
H Ferrada, D Kempa, SJ Puglisi
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and …, 2018
62018
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20