Juha Kärkkäinen

According to our database1, Juha Kärkkäinen authored at least 84 papers between 1995 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Better External Memory LCP Array Construction.
ACM Journal of Experimental Algorithmics, 2019

Constructing the Bijective BWT.
CoRR, 2019

Fixed Block Compression Boosting in FM-Indexes: Theory and Practice.
Algorithmica, 2019

Indexing the Bijective BWT.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Diverse Palindromic Factorization is NP-Complete.
Int. J. Found. Comput. Sci., 2018

Run Compressed Rank/Select for Large Alphabets.
Proceedings of the 2018 Data Compression Conference, 2018

2017
Engineering a Lightweight External Memory Suffix Array Construction Algorithm.
Mathematics in Computer Science, 2017

Document retrieval on repetitive string collections.
Inf. Retr. Journal, 2017

Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

On the Size of Lempel-Ziv and Lyndon Factorizations.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

On Suffix Tree Breadth.
Proceedings of the String Processing and Information Retrieval, 2017

String Inference from Longest-Common-Prefix Array.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Engineering External Memory Induced Suffix Sorting.
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, 2017

2016
Suffix Array Construction.
Encyclopedia of Algorithms, 2016

Multidimensional String Matching.
Encyclopedia of Algorithms, 2016

Tighter bounds for the sum of irreducible LCP values.
Theor. Comput. Sci., 2016

Lazy Lempel-Ziv Factorization Algorithms.
ACM Journal of Experimental Algorithmics, 2016

LCP Array Construction in External Memory.
ACM Journal of Experimental Algorithmics, 2016

V-Order: New combinatorial properties & a simple comparison algorithm.
Discrete Applied Mathematics, 2016

String Inference from the LCP Array.
CoRR, 2016

Linear-time string indexing and analysis in small space.
CoRR, 2016

Lempel-Ziv Decoding in External Memory.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

LCP Array Construction Using O(sort(n)) (or Less) I/Os.
Proceedings of the String Processing and Information Retrieval, 2016

Faster External Memory LCP Array Construction.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Faster, Minuter.
Proceedings of the 2016 Data Compression Conference, 2016

2015
Computing the Burrows-Wheeler transform in place and in small space.
J. Discrete Algorithms, 2015

Diverse Palindromic Factorization is NP-Complete.
CoRR, 2015

Diverse Palindromic Factorization Is NP-complete.
Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Document Counting in Compressed Space.
Proceedings of the 2015 Data Compression Conference, 2015

Queries on LZ-Bounded Encodings.
Proceedings of the 2015 Data Compression Conference, 2015

Parallel External Memory Suffix Sorting.
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014
Editorial.
J. Discrete Algorithms, 2014

Multi-pattern matching with bidirectional indexes.
J. Discrete Algorithms, 2014

A subquadratic algorithm for minimum palindromic factorization.
J. Discrete Algorithms, 2014

Document Counting in Practice.
CoRR, 2014

Faster Sparse Suffix Sorting.
Proceedings of the 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014), 2014

LZ77-Based Self-indexing with Faster Pattern Matching.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Hybrid Compression of Bitvectors for the FM-Index.
Proceedings of the Data Compression Conference, 2014

Lempel-Ziv Parsing in External Memory.
Proceedings of the Data Compression Conference, 2014

String Range Matching.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
Colored range queries and document retrieval.
Theor. Comput. Sci., 2013

Lightweight Lempel-Ziv Parsing.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Crochemore's String Matching Algorithm: Simplification, Extensions, Applications.
Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform.
Proceedings of the Algorithms - ESA 2013, 2013

Near in Place Linear Time Minimum Redundancy Coding.
Proceedings of the 2013 Data Compression Conference, 2013

Linear Time Lempel-Ziv Factorization: Simple, Fast, Small.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

A Constant-Space Comparison-Based Algorithm for Computing the Burrows-Wheeler Transform.
Proceedings of the Combinatorial Pattern Matching, 24th Annual Symposium, 2013

2012
Grammar Precompression Speeds Up Burrows-Wheeler Compression.
Proceedings of the String Processing and Information Retrieval, 2012

Indexed Multi-pattern Matching.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

A Faster Grammar-Based Self-index.
Proceedings of the Language and Automata Theory and Applications, 2012

Slashing the Time for BWT Inversion.
Proceedings of the 2012 Data Compression Conference, Snowbird, UT, USA, April 10-12, 2012, 2012

2011
A Compressed Self-Index for Genomic Databases
CoRR, 2011

Fixed Block Compression Boosting in FM-Indexes.
Proceedings of the String Processing and Information Retrieval, 2011

Counting Colours in Compressed Strings.
Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Cache Friendly Burrows-Wheeler Inversion.
Proceedings of the First International Conference on Data Compression, 2011

2010
Pattern Kits
CoRR, 2010

Medium-Space Algorithms for Inverse BWT.
Proceedings of the Algorithms, 2010

2009
Permuted Longest-Common-Prefix Array.
Proceedings of the Combinatorial Pattern Matching, 20th Annual Symposium, 2009

2008
Multidimensional String Matching.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Suffix Array Construction.
Proceedings of the Encyclopedia of Algorithms - 2008 Edition, 2008

Better external memory suffix array construction.
ACM Journal of Experimental Algorithmics, 2008

Engineering Radix Sort for Strings.
Proceedings of the String Processing and Information Retrieval, 2008

2007
Fast BWT in small space by blockwise suffix sorting.
Theor. Comput. Sci., 2007

Faster Filters for Approximate String Matching.
Proceedings of the Nine Workshop on Algorithm Engineering and Experiments, 2007

2006
Linear work suffix array construction.
J. ACM, 2006

2005
Bdd-based analysis of gapped q-gram Filters.
Int. J. Found. Comput. Sci., 2005

Alphabets in generic programming.
Proceedings of the Prague Stringology Conference, 2005

2003
Approximate string matching on Ziv-Lempel compressed text.
J. Discrete Algorithms, 2003

Better Filtering with Gapped q-Grams.
Fundam. Inform., 2003

Simple Linear Work Suffix Array Construction.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

Fast Lightweight Suffix Array Construction and Checking.
Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002
Computing the Threshold for q-Gram Filters.
Proceedings of the Algorithm Theory, 2002

Full-Text Indexes in External Memory.
Proceedings of the Algorithms for Memory Hierarchies, 2002

One-Gapped q-Gram Filtersfor Levenshtein Distance.
Proceedings of the Combinatorial Pattern Matching, 13th Annual Symposium, 2002

2000
Approximate String Matching over Ziv-Lempel Compressed Text.
Proceedings of the Combinatorial Pattern Matching, 11th Annual Symposium, 2000

1999
Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time.
SIAM J. Comput., 1999

TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies.
Comput. J., 1999

Mining for similarities in aligned time series using wavelets.
Proceedings of the Data Mining and Knowledge Discovery: Theory, 1999

1998
Lempel-Ziv Index for q-Grams.
Algorithmica, 1998

Efficient Discovery of Functional and Approximate Dependencies Using Partitions.
Proceedings of the Fourteenth International Conference on Data Engineering, 1998

1997
Episode Matching.
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

1996
Lempel-Ziv Index for q-Grams.
Proceedings of the Algorithms, 1996

Sparse Suffix Trees.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
Suffix Cactus: A Cross between Suffix Tree and Suffix Array.
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995


  Loading...