Suffix Cactus: A Cross between Suffix Tree and Suffix Array. - Juha Kärkkäinen (CPM, 1995)

Sparse Suffix Trees. - Juha Kärkkäinen; Esko Ukkonen (COCOON, 1996)

Lempel-Ziv Index for q-Grams. - Juha Kärkkäinen; Erkki Sutinen (ESA, 1996)

Episode Matching. - Gautam Das 001; Rudolf Fleischer; Leszek Gasieniec; Dimitrios Gunopulos; Juha Kärkkäinen (CPM, 1997)

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

Lempel-Ziv Index for q-Grams. - Juha Kärkkäinen; Erkki Sutinen (Algorithmica, 1998)

Mining for similarities in aligned time series using wavelets. - Ykä Huhtala; Juha Kärkkäinen; Hannu Toivonen (Data Mining and Knowledge Discovery: Theory, Tools, and Technology, 1999)

TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. - Ykä Huhtala; Juha Kärkkäinen; Pasi Porkka; Hannu Toivonen (Comput. J., 1999)

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

Approximate String Matching over Ziv-Lempel Compressed Text. - Juha Kärkkäinen; Gonzalo Navarro 001; Esko Ukkonen (CPM, 2000)

One-Gapped q-Gram Filtersfor Levenshtein Distance. - Stefan Burkhardt; Juha Kärkkäinen (CPM, 2002)

Full-Text Indexes in External Memory. - Juha Kärkkäinen; S. Srinivasa Rao 001 (Algorithms for Memory Hierarchies, 2002)

Computing the Threshold for q-Gram Filters. - Juha Kärkkäinen (SWAT, 2002)

Fast Lightweight Suffix Array Construction and Checking. - Stefan Burkhardt; Juha Kärkkäinen (CPM, 2003)

Simple Linear Work Suffix Array Construction. - Juha Kärkkäinen; Peter Sanders 001 (ICALP, 2003)

Better Filtering with Gapped q-Grams. - Stefan Burkhardt; Juha Kärkkäinen (Fundam. Informaticae, 2003)

Approximate string matching on Ziv-Lempel compressed text. - Juha Kärkkäinen; Gonzalo Navarro 001; Esko Ukkonen (J. Discrete Algorithms, 2003)

Alphabets in generic programming. - Juha Kärkkäinen (Stringology, 2005)

Bdd-based analysis of gapped q-gram Filters. - Marc Fontaine; Stefan Burkhardt; Juha Kärkkäinen (Int. J. Found. Comput. Sci., 2005)

Linear work suffix array construction. - Juha Kärkkäinen; Peter Sanders 001; Stefan Burkhardt (J. ACM, 2006)

Faster Filters for Approximate String Matching. - Juha Kärkkäinen; Joong Chae Na (ALENEX, 2007)

Fast BWT in small space by blockwise suffix sorting. - Juha Kärkkäinen (Theor. Comput. Sci., 2007)

Engineering Radix Sort for Strings. - Juha Kärkkäinen; Tommi Rantala (SPIRE, 2008)

Better external memory suffix array construction. - Roman Dementiev; Juha Kärkkäinen; Jens Mehnert; Peter Sanders 001 (ACM J. Exp. Algorithmics, 2008)

Suffix Array Construction. - Juha Kärkkäinen (Encyclopedia of Algorithms, 2008)

Multidimensional String Matching. - Juha Kärkkäinen; Esko Ukkonen (Encyclopedia of Algorithms, 2008)

Permuted Longest-Common-Prefix Array. - Juha Kärkkäinen; Giovanni Manzini; Simon J. Puglisi (CPM, 2009)

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

Pattern Kits - Travis Gagie; Kalle Karhu; Juha Kärkkäinen; Veli Mäkinen; Leena Salmela (CoRR, 2010)

Cache Friendly Burrows-Wheeler Inversion. - Juha Kärkkäinen; Simon J. Puglisi (CCP, 2011)

Counting Colours in Compressed Strings. - Travis Gagie; Juha Kärkkäinen (CPM, 2011)

Fixed Block Compression Boosting in FM-Indexes. - Juha Kärkkäinen; Simon J. Puglisi (SPIRE, 2011)

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

Slashing the Time for BWT Inversion. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (DCC, 2012)

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

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

Grammar Precompression Speeds Up Burrows-Wheeler Compression. - Juha Kärkkäinen; Pekka Mikkola; Dominik Kempa (SPIRE, 2012)

A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform. - Maxime Crochemore; Roberto Grossi; Juha Kärkkäinen; Gad M. Landau (CPM, 2013)

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

Near in Place Linear Time Minimum Redundancy Coding. - Juha Kärkkäinen; German Tischler (DCC, 2013)

Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform. - Djamal Belazzougui; Fabio Cunial; Juha Kärkkäinen; Veli Mäkinen (ESA, 2013)

Crochemore's String Matching Algorithm: Simplification, Extensions, Applications. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (Stringology, 2013)

Lightweight Lempel-Ziv Parsing. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (SEA, 2013)

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

String Range Matching. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (CPM, 2014)

Lempel-Ziv Parsing in External Memory. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (DCC, 2014)

Hybrid Compression of Bitvectors for the FM-Index. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (DCC, 2014)

LZ77-Based Self-indexing with Faster Pattern Matching. - Travis Gagie; Pawel Gawrychowski; Juha Kärkkäinen; Yakov Nekrich; Simon J. Puglisi (LATIN, 2014)

Faster Sparse Suffix Sorting. - Tomohiro I; Juha Kärkkäinen; Dominik Kempa (STACS, 2014)

Document Counting in Practice. - Travis Gagie; Aleksi Hartikainen; Juha Kärkkäinen; Gonzalo Navarro 001; Simon J. Puglisi; Jouni Sirén (CoRR, 2014)

A subquadratic algorithm for minimum palindromic factorization. - Gabriele Fici; Travis Gagie; Juha Kärkkäinen; Dominik Kempa (J. Discrete Algorithms, 2014)

Multi-pattern matching with bidirectional indexes. - Simon Gog; Kalle Karhu; Juha Kärkkäinen; Veli Mäkinen; Niko Välimäki (J. Discrete Algorithms, 2014)

Editorial. - Jens Stoye; Juha Kärkkäinen (J. Discrete Algorithms, 2014)

Parallel External Memory Suffix Sorting. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (CPM, 2015)

Queries on LZ-Bounded Encodings. - Djamal Belazzougui; Travis Gagie; Pawel Gawrychowski; Juha Kärkkäinen; Alberto Ordóñez Pereira; Simon J. Puglisi; Yasuo Tabei (DCC, 2015)

Document Counting in Compressed Space. - Travis Gagie; Aleksi Hartikainen; Juha Kärkkäinen; Gonzalo Navarro 001; Simon J. Puglisi; Jouni Sirén (DCC, 2015)

Diverse Palindromic Factorization Is NP-complete. - Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto (DLT, 2015)

Diverse Palindromic Factorization is NP-Complete. - Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Simon J. Puglisi; Shiho Sugimoto (CoRR, 2015)

Computing the Burrows-Wheeler transform in place and in small space. - Maxime Crochemore; Roberto Grossi; Juha Kärkkäinen; Gad M. Landau (J. Discrete Algorithms, 2015)

Faster, Minuter. - Simon Gog; Juha Kärkkäinen; Dominik Kempa; Matthias Petri; Simon J. Puglisi (DCC, 2016)

Faster External Memory LCP Array Construction. - Juha Kärkkäinen; Dominik Kempa (ESA, 2016)

LCP Array Construction Using O(sort(n)) (or Less) I/Os. - Juha Kärkkäinen; Dominik Kempa (SPIRE, 2016)

Lempel-Ziv Decoding in External Memory. - Djamal Belazzougui; Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (SEA, 2016)

String Inference from the LCP Array. - Juha Kärkkäinen; Marcin Piatkowski; Simon J. Puglisi (CoRR, 2016)

V-Order: New combinatorial properties & a simple comparison algorithm. - Ali Alatabbi; Jacqueline W. Daykin; Juha Kärkkäinen; M. Sohel Rahman; W. F. Smyth (Discret. Appl. Math., 2016)

LCP Array Construction in External Memory. - Juha Kärkkäinen; Dominik Kempa (ACM J. Exp. Algorithmics, 2016)

Lazy Lempel-Ziv Factorization Algorithms. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi (ACM J. Exp. Algorithmics, 2016)

Tighter bounds for the sum of irreducible LCP values. - Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski (Theor. Comput. Sci., 2016)

Multidimensional String Matching. - Juha Kärkkäinen (Encyclopedia of Algorithms, 2016)

Suffix Array Construction. - Juha Kärkkäinen (Encyclopedia of Algorithms, 2016)

Engineering External Memory Induced Suffix Sorting. - Juha Kärkkäinen; Dominik Kempa; Simon J. Puglisi; Bella Zhukova (ALENEX, 2017)

On Suffix Tree Breadth. - Golnaz Badkobeh; Juha Kärkkäinen; Simon J. Puglisi; Bella Zhukova (SPIRE, 2017)

On the Size of Lempel-Ziv and Lyndon Factorizations. - Juha Kärkkäinen; Dominik Kempa; Yuto Nakashima 001; Simon J. Puglisi; Arseny M. Shur (STACS, 2017)

Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet. - Juha Kärkkäinen; Dominik Kempa (SEA, 2017)

Document retrieval on repetitive string collections. - Travis Gagie; Aleksi Hartikainen; Kalle Karhu; Juha Kärkkäinen; Gonzalo Navarro 001; Simon J. Puglisi; Jouni Sirén (Inf. Retr. J., 2017)

Engineering a Lightweight External Memory Suffix Array Construction Algorithm. - Juha Kärkkäinen; Dominik Kempa (Math. Comput. Sci., 2017)

Run Compressed Rank/Select for Large Alphabets. - José Fuentes-Sepúlveda; Juha Kärkkäinen; Dmitry Kosolobov; Simon J. Puglisi (DCC, 2018)

Diverse Palindromic Factorization is NP-Complete. - Hideo Bannai; Travis Gagie; Shunsuke Inenaga; Juha Kärkkäinen; Dominik Kempa; Marcin Piatkowski; Shiho Sugimoto (Int. J. Found. Comput. Sci., 2018)

Indexing the Bijective BWT. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (CPM, 2019)

Fixed Block Compression Boosting in FM-Indexes: Theory and Practice. - Simon Gog; Juha Kärkkäinen; Dominik Kempa; Matthias Petri; Simon J. Puglisi (Algorithmica, 2019)

Constructing the Bijective BWT. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (CoRR, 2019)

Better External Memory LCP Array Construction. - Juha Kärkkäinen; Dominik Kempa (ACM J. Exp. Algorithmics, 2019)

Linear-time String Indexing and Analysis in Small Space. - Djamal Belazzougui; Fabio Cunial; Juha Kärkkäinen; Veli Mäkinen (ACM Trans. Algorithms, 2020)

Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (CPM, 2021)

Block trees. - Djamal Belazzougui; Manuel Cáceres; Travis Gagie; Pawel Gawrychowski; Juha Kärkkäinen; Gonzalo Navarro 001; Alberto Ordóñez Pereira; Simon J. Puglisi; Yasuo Tabei (J. Comput. Syst. Sci., 2021)

Tight upper and lower bounds on suffix tree breadth. - Golnaz Badkobeh; Pawel Gawrychowski; Juha Kärkkäinen; Simon J. Puglisi; Bella Zhukova (Theor. Comput. Sci., 2021)

String inference from longest-common-prefix array. - Juha Kärkkäinen; Marcin Piatkowski; Simon J. Puglisi (Theor. Comput. Sci., 2023)

Constructing and indexing the bijective and extended Burrows-Wheeler transform. - Hideo Bannai; Juha Kärkkäinen; Dominik Köppl; Marcin Piatkowski (Inf. Comput., 2024)