default search action
Juha Kärkkäinen
Person information
- affiliation: University of Helsinki, Finland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j28]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl
, Marcin Piatkowski:
Constructing and indexing the bijective and extended Burrows-Wheeler transform. Inf. Comput. 297: 105153 (2024) - 2023
- [j27]Juha Kärkkäinen, Marcin Piatkowski
String inference from longest-common-prefix array. Theor. Comput. Sci. 942: 180-199 (2023) - 2021
- [j26]Djamal Belazzougui, Manuel Cáceres
Block trees. J. Comput. Syst. Sci. 117: 1-22 (2021) - [j25]Golnaz Badkobeh, Pawel Gawrychowski
Tight upper and lower bounds on suffix tree breadth. Theor. Comput. Sci. 854: 63-67 (2021) - [c59]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. CPM 2021: 7:1-7:16 - 2020
- [j24]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen
Linear-time String Indexing and Analysis in Small Space. ACM Trans. Algorithms 16(2): 17:1-17:54 (2020)
2010 – 2019
- 2019
- [j23]Simon Gog
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) - [c58]Hideo Bannai
Indexing the Bijective BWT. CPM 2019: 17:1-17:14 - [i18]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski:
Constructing the Bijective BWT. CoRR abs/1911.06985 (2019) - 2018
- [j21]Hideo Bannai, Travis Gagie
Diverse Palindromic Factorization is NP-Complete. Int. J. Found. Comput. Sci. 29(2): 143-164 (2018) - [c57]José Fuentes-Sepúlveda
Run Compressed Rank/Select for Large Alphabets. DCC 2018: 315-324 - 2017
- [j20]Travis Gagie
Document retrieval on repetitive string collections. Inf. Retr. J. 20(3): 253-291 (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
Engineering External Memory Induced Suffix Sorting. ALENEX 2017: 98-108 - [c55]Juha Kärkkäinen, Marcin Piatkowski
String Inference from Longest-Common-Prefix Array. ICALP 2017: 62:1-62:14 - [c54]Golnaz Badkobeh, Juha Kärkkäinen, Simon J. Puglisi
On Suffix Tree Breadth. SPIRE 2017: 68-73 - [c53]Juha Kärkkäinen, Dominik Kempa
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 - [e2]Juha Kärkkäinen, Jakub Radoszewski, Wojciech Rytter:
28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, July 4-6, 2017, Warsaw, Poland. LIPIcs 78, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-039-2 [contents] - [i17]José Fuentes-Sepúlveda, Juha Kärkkäinen, Dmitry Kosolobov, Simon J. Puglisi:
Run Compressed Rank/Select for Large Alphabets. CoRR abs/1711.02910 (2017) - 2016
- [j18]Ali Alatabbi
V-Order: New combinatorial properties & a simple comparison algorithm. Discret. Appl. Math. 215: 41-46 (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
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
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
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
Lempel-Ziv Decoding in External Memory. SEA 2016: 63-74 - [r4]Juha Kärkkäinen:
Multidimensional String Matching. Encyclopedia of Algorithms 2016: 1369-1372 - [r3]Juha Kärkkäinen:
Suffix Array Construction. Encyclopedia of Algorithms 2016: 2141-2144 - [i16]Djamal Belazzougui, Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Lempel-Ziv Decoding in External Memory. CoRR abs/1602.00329 (2016) - [i15]Travis Gagie, Aleksi Hartikainen, Kalle Karhu, Juha Kärkkäinen, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén:
Document Retrieval on Repetitive String Collections. CoRR abs/1605.09362 (2016) - [i14]Juha Kärkkäinen, Marcin Piatkowski, Simon J. Puglisi:
String Inference from the LCP Array. CoRR abs/1606.04573 (2016) - [i13]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen:
Linear-time string indexing and analysis in small space. CoRR abs/1609.06378 (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
- [j14]Maxime Crochemore
Computing the Burrows-Wheeler transform in place and in small space. J. Discrete Algorithms 32: 44-52 (2015) - [c47]Juha Kärkkäinen, Dominik Kempa
Tighter Bounds for the Sum of Irreducible LCP Values. CPM 2015: 316-328 - [c46]Juha Kärkkäinen, Dominik Kempa
Parallel External Memory Suffix Sorting. CPM 2015: 329-342 - [c45]Djamal Belazzougui, Travis Gagie
Queries on LZ-Bounded Encodings. DCC 2015: 83-92 - [c44]Travis Gagie
Document Counting in Compressed Space. DCC 2015: 103-112 - [c43]Hideo Bannai, Travis Gagie
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
- [j13]Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen
Multi-pattern matching with bidirectional indexes. J. Discrete Algorithms 24: 26-39 (2014) - [j12]Jens Stoye, Juha Kärkkäinen:
Editorial. J. Discrete Algorithms 25: 1 (2014) - [j11]Gabriele Fici
A subquadratic algorithm for minimum palindromic factorization. J. Discrete Algorithms 28: 41-48 (2014) - [c42]Juha Kärkkäinen, Dominik Kempa
String Range Matching. CPM 2014: 232-241 - [c41]Juha Kärkkäinen, Dominik Kempa
Lempel-Ziv Parsing in External Memory. DCC 2014: 153-162 - [c40]Juha Kärkkäinen, Dominik Kempa
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 - [c38]Travis Gagie
LZ77-Based Self-indexing with Faster Pattern Matching. LATIN 2014: 731-742 - [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) - [i9]Travis Gagie, Aleksi Hartikainen, Juha Kärkkäinen, Gonzalo Navarro, Simon J. Puglisi, Jouni Sirén:
Document Counting in Practice. CoRR abs/1409.6780 (2014) - [i8]Djamal Belazzougui, Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Alberto Ordóñez Pereira, Simon J. Puglisi, Yasuo Tabei:
Queries on LZ-Bounded Encodings. CoRR abs/1412.0967 (2014) - 2013
- [j10]Travis Gagie
Colored range queries and document retrieval. Theor. Comput. Sci. 483: 36-50 (2013) - [c35]Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau:
A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. CPM 2013: 74-82 - [c34]Juha Kärkkäinen, Dominik Kempa
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. CPM 2013: 189-200 - [c33]Juha Kärkkäinen, German Tischler:
Near in Place Linear Time Minimum Redundancy Coding. DCC 2013: 411-420 - [c32]Djamal Belazzougui, Fabio Cunial, Juha Kärkkäinen, Veli Mäkinen
Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform. ESA 2013: 133-144 - [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
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
- [c29]Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen
Multi-pattern Matching with Bidirectional Indexes. COCOON 2012: 384-395 - [c28]Juha Kärkkäinen, Dominik Kempa
Slashing the Time for BWT Inversion. DCC 2012: 99-108 - [c27]Travis Gagie
A Faster Grammar-Based Self-index. LATA 2012: 240-251 - [c26]Travis Gagie
Indexed Multi-pattern Matching. LATIN 2012: 399-407 - [c25]Juha Kärkkäinen, Pekka Mikkola, Dominik Kempa:
Grammar Precompression Speeds Up Burrows-Wheeler Compression. SPIRE 2012: 330-335 - [e1]Juha Kärkkäinen, Jens Stoye
Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings. Lecture Notes in Computer Science 7354, Springer 2012, ISBN 978-3-642-31264-9 [contents] - [i5]Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi:
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. CoRR abs/1212.2952 (2012) - 2011
- [c24]Juha Kärkkäinen, Simon J. Puglisi:
Cache Friendly Burrows-Wheeler Inversion. CCP 2011: 38-42 - [c23]Travis Gagie
Counting Colours in Compressed Strings. CPM 2011: 197-207 - [c22]Juha Kärkkäinen, Simon J. Puglisi:
Fixed Block Compression Boosting in FM-Indexes. SPIRE 2011: 174-184 - [i4]Juha Kärkkäinen, Simon J. Puglisi:
Fixed Block Compression Boosting in FM-Indexes. CoRR abs/1104.3810 (2011) - [i3]Travis Gagie, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi:
A Compressed Self-Index for Genomic Databases. CoRR abs/1111.1355 (2011) - 2010
- [c21]Juha Kärkkäinen, Simon J. Puglisi:
Medium-Space Algorithms for Inverse BWT. ESA (1) 2010: 451-462 - [i2]Travis Gagie, Juha Kärkkäinen:
Counting Colours in Compressed Strings. CoRR abs/1011.3480 (2010) - [i1]Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela:
Pattern Kits. CoRR abs/1011.3491 (2010)
2000 – 2009
- 2009
- [c20]Juha Kärkkäinen, Giovanni Manzini
Permuted Longest-Common-Prefix Array. CPM 2009: 181-192 - 2008
- [j9]Roman Dementiev, Juha Kärkkäinen, Jens Mehnert
Better external memory suffix array construction. ACM J. Exp. Algorithmics 12: 3.4:1-3.4:24 (2008) - [c19]Juha Kärkkäinen, Tommi Rantala:
Engineering Radix Sort for Strings. SPIRE 2008: 3-14 - [r2]Juha Kärkkäinen:
Suffix Array Construction. Encyclopedia of Algorithms 2008 - [r1]Juha Kärkkäinen, Esko Ukkonen:
Multidimensional String Matching. Encyclopedia of Algorithms 2008 - 2007
- [j8]Juha Kärkkäinen:
Fast BWT in small space by blockwise suffix sorting. Theor. Comput. Sci. 387(3): 249-257 (2007) - [c18]Juha Kärkkäinen, Joong Chae Na:
Faster Filters for Approximate String Matching. ALENEX 2007 - 2006
- [j7]Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt:
Linear work suffix array construction. J. ACM 53(6): 918-936 (2006) - 2005
- [j6]Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen:
Bdd-based analysis of gapped q-gram Filters. Int. J. Found. Comput. Sci. 16(6): 1121-1134 (2005) - [c17]Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders:
Better External Memory Suffix Array Construction. ALENEX/ANALCO 2005: 86-97 - [c16]Juha Kärkkäinen:
Alphabets in generic programming. Stringology 2005: 163-173 - 2004
- [c15]Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen:
BDD-Based Analysis of Gapped q-Gram Filters. Stringology 2004: 56-68 - 2003
- [j5]Stefan Burkhardt, Juha Kärkkäinen:
Better Filtering with Gapped q-Grams. Fundam. Informaticae 56(1-2): 51-70 (2003) - [j4]Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen:
Approximate string matching on Ziv-Lempel compressed text. J. Discrete Algorithms 1(3-4): 313-338 (2003) - [c14]Stefan Burkhardt, Juha Kärkkäinen:
Fast Lightweight Suffix Array Construction and Checking. CPM 2003: 55-69 - [c13]Juha Kärkkäinen, Peter Sanders:
Simple Linear Work Suffix Array Construction. ICALP 2003: 943-955 - 2002
- [c12]Stefan Burkhardt, Juha Kärkkäinen:
One-Gapped q-Gram Filtersfor Levenshtein Distance. CPM 2002: 225-234 - [c11]Juha Kärkkäinen, S. Srinivasa Rao:
Full-Text Indexes in External Memory. Algorithms for Memory Hierarchies 2002: 149-170 - [c10]Juha Kärkkäinen:
Computing the Threshold for q-Gram Filters. SWAT 2002: 348-357 - 2001
- [c9]Stefan Burkhardt, Juha Kärkkäinen:
Better Filtering with Gapped q-Grams. CPM 2001: 73-85 - 2000
- [c8]Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen:
Approximate String Matching over Ziv-Lempel Compressed Text. CPM 2000: 195-209
1990 – 1999
- 1999
- [j3]Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen
TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. Comput. J. 42(2): 100-111 (1999) - [j2]Juha Kärkkäinen, Esko Ukkonen:
Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time. SIAM J. Comput. 29(2): 571-589 (1999) - [c7]Ykä Huhtala, Juha Kärkkäinen, Hannu Toivonen
Mining for similarities in aligned time series using wavelets. Data Mining and Knowledge Discovery: Theory, Tools, and Technology 1999: 150-160 - 1998
- [j1]Juha Kärkkäinen, Erkki Sutinen:
Lempel-Ziv Index for q-Grams. Algorithmica 21(1): 137-154 (1998) - [c6]Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen
Efficient Discovery of Functional and Approximate Dependencies Using Partitions. ICDE 1998: 392-401 - 1997
- [c5]Gautam Das
Episode Matching. CPM 1997: 12-27 - 1996
- [c4]Juha Kärkkäinen, Esko Ukkonen:
Sparse Suffix Trees. COCOON 1996: 219-230 - [c3]Juha Kärkkäinen, Erkki Sutinen:
Lempel-Ziv Index for q-Grams. ESA 1996: 378-391 - 1995
- [c2]Juha Kärkkäinen:
Suffix Cactus: A Cross between Suffix Tree and Suffix Array. CPM 1995: 191-204 - 1994
- [c1]Juha Kärkkäinen, Esko Ukkonen:
Two and Higher Dimensional Pattern Matching in Optimal Expected Time. SODA 1994: 715-723
Coauthor Index
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: