default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuha Kärkkäinen
- > Home > Persons > Juha Kärkkäinen
Publications
- 2019
[j23]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): 1370-1391 (2019)- [j22]Juha Kärkkäinen, Dominik Kempa:
Better External Memory LCP Array Construction. ACM J. Exp. Algorithmics 24(1): 1.3:1-1.3:27 (2019) - 2018
- [j21]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): 143-164 (2018) - 2017
- [j19]Juha Kärkkäinen, Dominik Kempa:
Engineering a Lightweight External Memory Suffix Array Construction Algorithm. Math. Comput. Sci. 11(2): 137-149 (2017) - [c56]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi, Bella Zhukova:
Engineering External Memory Induced Suffix Sorting. ALENEX 2017: 98-108 - [c53]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: 45:1-45:13 - [c52]Juha Kärkkäinen, Dominik Kempa:
Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet. SEA 2017: 17:1-17:14 - 2016
- [j17]Juha Kärkkäinen, Dominik Kempa:
LCP Array Construction in External Memory. ACM J. Exp. Algorithmics 21(1): 1.7:1-1.7:22 (2016) - [j16]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lazy Lempel-Ziv Factorization Algorithms. ACM J. Exp. Algorithmics 21(1): 2.4:1-2.4:19 (2016) - [j15]Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski:
Tighter bounds for the sum of irreducible LCP values. Theor. Comput. Sci. 656: 265-278 (2016) - [c51]Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi:
Faster, Minuter. DCC 2016: 53-62 - [c50]Juha Kärkkäinen, Dominik Kempa:
Faster External Memory LCP Array Construction. ESA 2016: 61:1-61:16 - [c49]Juha Kärkkäinen, Dominik Kempa:
LCP Array Construction Using O(sort(n)) (or Less) I/Os. SPIRE 2016: 204-217 - [c48]Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Decoding in External Memory. SEA 2016: 63-74 - [i16]Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Decoding in External Memory. CoRR abs/1602.00329 (2016) - [i12]Juha Kärkkäinen, Dominik Kempa, Yuto Nakashima, Simon J. Puglisi, Arseny M. Shur:
On the Size of Lempel-Ziv and Lyndon Factorizations. CoRR abs/1611.08898 (2016) - 2015
- [c47]Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski:
Tighter Bounds for the Sum of Irreducible LCP Values. CPM 2015: 316-328 - [c46]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Parallel External Memory Suffix Sorting. CPM 2015: 329-342 - [c43]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: 85-96 - [i11]Travis Gagie, Shunsuke Inenaga, Juha Kärkkäinen, Dominik Kempa, Marcin Piatkowski, Simon J. Puglisi, Shiho Sugimoto:
Diverse Palindromic Factorization is NP-Complete. CoRR abs/1503.04045 (2015) - 2014
- [j11]Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa:
A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms 28: 41-48 (2014) - [c42]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
String Range Matching. CPM 2014: 232-241 - [c41]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Parsing in External Memory. DCC 2014: 153-162 - [c40]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Hybrid Compression of Bitvectors for the FM-Index. DCC 2014: 302-311 - [c39]Juha Kärkkäinen, Dominik Kempa:
Engineering a Lightweight External Memory Suffix Array Construction Algorithm. ICABD 2014: 53-60 - [c37]Tomohiro I, Juha Kärkkäinen, Dominik Kempa:
Faster Sparse Suffix Sorting. STACS 2014: 386-396 - [c36]Juha Kärkkäinen, Dominik Kempa:
LCP Array Construction in External Memory. SEA 2014: 412-423 - [i10]Gabriele Fici, Travis Gagie, Juha Kärkkäinen, Dominik Kempa:
A Subquadratic Algorithm for Minimum Palindromic Factorization. CoRR abs/1403.2431 (2014) - 2013
- [c34]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. CPM 2013: 189-200 - [c31]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Crochemore's String Matching Algorithm: Simplification, Extensions, Applications. Stringology 2013: 168-175 - [c30]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lightweight Lempel-Ziv Parsing. SEA 2013: 139-150 - [i7]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lightweight Lempel-Ziv Parsing. CoRR abs/1302.1064 (2013) - [i6]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Parsing in External Memory. CoRR abs/1307.1428 (2013) - 2012
- [c28]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Slashing the Time for BWT Inversion. DCC 2012: 99-108 - [c25]Juha Kärkkäinen, Pekka Mikkola, Dominik Kempa:
Grammar Precompression Speeds Up Burrows-Wheeler Compression. SPIRE 2012: 330-335 - [i5]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. CoRR abs/1212.2952 (2012)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-25 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
