Juha Kärkkäinen

Travis Gagie, Juha Kärkkäinen, Gonzalo Navarro, Simon J. Puglisi: Colored range queries and document retrieval. Theor. Comput. Sci. 483: 36-50 (2013)

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

Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi: Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. CPM 2013: 189-200

Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi: Lightweight Lempel-Ziv Parsing. SEA 2013: 139-150

Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi: Lightweight Lempel-Ziv Parsing. CoRR abs/1302.1064 (2013)

Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki: Multi-pattern Matching with Bidirectional Indexes. COCOON 2012: 384-395

Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi: Slashing the Time for BWT Inversion. DCC 2012: 99-108

Travis Gagie, Pawel Gawrychowski, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi: A Faster Grammar-Based Self-index. LATA 2012: 240-251

Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela, Jorma Tarhio: Indexed Multi-pattern Matching. LATIN 2012: 399-407

Juha Kärkkäinen, Pekka Mikkola, Dominik Kempa: Grammar Precompression Speeds Up Burrows-Wheeler Compression. SPIRE 2012: 330-335

Juha Kärkkäinen, Jens Stoye (Eds.): 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

Juha Kärkkäinen, Dominik Kempa, Simon J. Puglisi: Linear Time Lempel-Ziv Factorization: Simple, Fast, Small. CoRR abs/1212.2952 (2012)

Juha Kärkkäinen, Simon J. Puglisi: Cache Friendly Burrows-Wheeler Inversion. CCP 2011: 38-42

Travis Gagie, Juha Kärkkäinen: Counting Colours in Compressed Strings. CPM 2011: 197-207

Juha Kärkkäinen, Simon J. Puglisi: Fixed Block Compression Boosting in FM-Indexes. SPIRE 2011: 174-184

Juha Kärkkäinen, Simon J. Puglisi: Fixed Block Compression Boosting in FM-Indexes. CoRR abs/1104.3810 (2011)

Travis Gagie, Juha Kärkkäinen, Yakov Nekrich, Simon J. Puglisi: A Compressed Self-Index for Genomic Databases. CoRR abs/1111.1355 (2011)

Juha Kärkkäinen, Simon J. Puglisi: Medium-Space Algorithms for Inverse BWT. ESA (1) 2010: 451-462

Travis Gagie, Juha Kärkkäinen: Counting Colours in Compressed Strings. CoRR abs/1011.3480 (2010)

Travis Gagie, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Leena Salmela: Pattern Kits. CoRR abs/1011.3491 (2010)

Juha Kärkkäinen, Giovanni Manzini, Simon J. Puglisi: Permuted Longest-Common-Prefix Array. CPM 2009: 181-192

Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders: Better external memory suffix array construction. ACM Journal of Experimental Algorithmics 12 (2008)

Juha Kärkkäinen, Tommi Rantala: Engineering Radix Sort for Strings. SPIRE 2008: 3-14

Juha Kärkkäinen: Suffix Array Construction. Encyclopedia of Algorithms 2008

Juha Kärkkäinen, Esko Ukkonen: Multidimensional String Matching. Encyclopedia of Algorithms 2008

Juha Kärkkäinen: Fast BWT in small space by blockwise suffix sorting. Theor. Comput. Sci. 387(3): 249-257 (2007)

Juha Kärkkäinen, Joong Chae Na: Faster Filters for Approximate String Matching. ALENEX 2007

Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt: Linear work suffix array construction. J. ACM 53(6): 918-936 (2006)

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)

Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders: Better External Memory Suffix Array Construction. ALENEX/ANALCO 2005: 86-97

Juha Kärkkäinen: Alphabets in generic programming. Stringology 2005: 163-173

Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen: BDD-Based Analysis of Gapped q-Gram Filters. Stringology 2004: 56-68

Stefan Burkhardt, Juha Kärkkäinen: Better Filtering with Gapped q-Grams. Fundam. Inform. 56(1-2): 51-70 (2003)

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)

Stefan Burkhardt, Juha Kärkkäinen: Fast Lightweight Suffix Array Construction and Checking. CPM 2003: 55-69

Juha Kärkkäinen, Peter Sanders: Simple Linear Work Suffix Array Construction. ICALP 2003: 943-955

Stefan Burkhardt, Juha Kärkkäinen: One-Gapped q-Gram Filtersfor Levenshtein Distance. CPM 2002: 225-234

Juha Kärkkäinen, S. Srinivasa Rao: Full-Text Indexes in External Memory. Algorithms for Memory Hierarchies 2002: 149-170

Juha Kärkkäinen: Computing the Threshold for q-Gram Filters. SWAT 2002: 348-357

Stefan Burkhardt, Juha Kärkkäinen: Better Filtering with Gapped q-Grams. CPM 2001: 73-85

Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen: Approximate String Matching over Ziv-Lempel Compressed Text. CPM 2000: 195-209

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)

Juha Kärkkäinen, Esko Ukkonen: Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time. SIAM J. Comput. 29(2): 571-589 (1999)

Juha Kärkkäinen, Erkki Sutinen: Lempel-Ziv Index for q-Grams. Algorithmica 21(1): 137-154 (1998)

Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen: Efficient Discovery of Functional and Approximate Dependencies Using Partitions. ICDE 1998: 392-401

Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen: Episode Matching. CPM 1997: 12-27

Juha Kärkkäinen, Esko Ukkonen: Sparse Suffix Trees. COCOON 1996: 219-230

Juha Kärkkäinen, Erkki Sutinen: Lempel-Ziv Index for q-Grams. ESA 1996: 378-391

Juha Kärkkäinen: Suffix Cactus: A Cross between Suffix Tree and Suffix Array. CPM 1995: 191-204

Juha Kärkkäinen, Esko Ukkonen: Two and Higher Dimensional Pattern Matching in Optimal Expected Time. SODA 1994: 715-723