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 | 141 | 2018 |
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 | 84 | 2013 |
Resolution of the burrows-wheeler transform conjecture D Kempa, T Kociumaka Communications of the ACM 65 (6), 91-98, 2022 | 80 | 2022 |
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 | 65 | 2019 |
Lightweight lempel-ziv parsing J Kärkkäinen, D Kempa, SJ Puglisi International Symposium on Experimental Algorithms, 139-150, 2013 | 54 | 2013 |
Lempel-Ziv factorization: Simple, fast, practical D Kempa, SJ Puglisi 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and …, 2013 | 51 | 2013 |
Parallel external memory suffix sorting J Kärkkäinen, D Kempa, SJ Puglisi Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia …, 2015 | 47 | 2015 |
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 | 47 | 2014 |
Hybrid compression of bitvectors for the FM-index J Kärkkäinen, D Kempa, SJ Puglisi 2014 Data Compression Conference, 302-311, 2014 | 46 | 2014 |
Lempel-Ziv parsing in external memory J Kärkkäinen, D Kempa, SJ Puglisi 2014 Data Compression Conference, 153-162, 2014 | 40 | 2014 |
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 | 39 | 2017 |
Engineering a lightweight external memory suffix array construction algorithm J Kärkkäinen, D Kempa Mathematics in Computer Science 11, 137-149, 2017 | 37 | 2017 |
LZ-End parsing in compressed space D Kempa, D Kosolobov 2017 Data Compression Conference (DCC), 350-359, 2017 | 32 | 2017 |
Optimal construction of compressed indexes for highly repetitive texts D Kempa Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 31 | 2019 |
LCP array construction in external memory J Kärkkäinen, D Kempa Journal of Experimental Algorithmics (JEA) 21, 1-22, 2016 | 29 | 2016 |
Dynamic suffix array with polylogarithmic queries and updates D Kempa, T Kociumaka Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 26 | 2022 |
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 | 26 | 2019 |
Hybrid indexing revisited H Ferrada, D Kempa, SJ Puglisi 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and …, 2018 | 23 | 2018 |
Tighter bounds for the sum of irreducible LCP values J Kärkkäinen, D Kempa, M Piatkowski Theoretical Computer Science 656, 265-278, 2016 | 23 | 2016 |
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 | 23 | 2015 |