World's Best Scientists 2026 revealed!
Juha Kärkkäinen

Juha Kärkkäinen

D-Index & Metrics

Computer Science

D-Index
30
Citations
4132
World Ranking
14062
National Ranking
129

Overview

Juha Kärkkäinen is affiliated with the University of Helsinki in Finland. Their research primarily encompasses the field of Computer Science with a focus on several subfields and topics. Juha's work includes contributions spanning Artificial Intelligence, Hardware and Architecture, Molecular Biology, Genetics, and Computational Theory and Mathematics.

The main topics addressed in their publications include:

  • Algorithms and Data Compression
  • Network Packet Processing and Optimization
  • Natural Language Processing Techniques
  • DNA and Biological Computing
  • Genome Rearrangement Algorithms
  • Semigroups and Automata Theory

Juha Kärkkäinen has contributed to a variety of journals and conference proceedings. Their frequent publication venues include:

  • Theoretical Computer Science
  • Journal of Computer and System Sciences
  • Information and Computation
  • ACM Transactions on Algorithms

Recent papers authored or co-authored by Juha Kärkkäinen include:

  • "String inference from longest-common-prefix array," 2022, published in Theoretical Computer Science
  • "Constructing and indexing the bijective and extended Burrows-Wheeler transform," 2024, published in Information and Computation
  • "Block trees," 2020, published in Journal of Computer and System Sciences
  • "Linear-time String Indexing and Analysis in Small Space," 2020, published in ACM Transactions on Algorithms
  • "Tight upper and lower bounds on suffix tree breadth," 2020, published in Theoretical Computer Science

Juha's frequent co-authors include Simon J. Puglisi, Djamal Belazzougui, Paweł Gawrychowski, Marcin Piątkowski, and Manuel Cáceres. Collaboration with these researchers spans multiple publications, with Simon J. Puglisi appearing as a co-author on three occasions, and others contributing to two or more joint works.

Best Publications

  • Tane: An Efficient Algorithm for Discovering Functional and Approximate Dependencies

    Ykä Huhtala;Juha Kärkkäinen;Pasi Porkka;Hannu Toivonen

  • Simple linear work suffix array construction

    Juha Kärkkäinen;Peter Sanders

  • Linear work suffix array construction

    Juha Kärkkäinen;Peter Sanders;Stefan Burkhardt

  • Efficient discovery of functional and approximate dependencies using partitions

    Y. Huhtala;J. Karkkainen;P. Porkka;H. Toivonen

  • Better filtering with gapped q-grams

    Stefan Burkhardt;Juha Kärkkäinen

  • Sparse Suffix Trees

    Juha Kärkkäinen;Esko Ukkonen

  • Better external memory suffix array construction

    Roman Dementiev;Juha Kärkkäinen;Jens Mehnert;Peter Sanders

  • Fast lightweight suffix array construction and checking

    Stefan Burkhardt;Juha Kärkkäinen

  • Permuted Longest-Common-Prefix Array

    Juha Kärkkäinen;Giovanni Manzini;Simon J. Puglisi

  • Episode Matching

    Gautam Das;Rudolf Fleischer;Leszek Gasieniec;Dimitrios Gunopulos

  • Fast BWT in small space by blockwise suffix sorting

    Juha Kärkkäinen

  • A faster grammar-based self-index

    Travis Gagie;Paweł Gawrychowski;Juha Kärkkäinen;Yakov Nekrich

  • Suffix cactus: A cross between suffix tree and suffix array

    Juha Kärkkäinen

  • Fast Lightweight Suffix Array Construction and Checking

    Stefan Burkhardt;Juha Kärkkäinen;R. Baeza-Yates;E. Chávez

  • Mining for similarities in aligned time series using wavelets

    Yka Huhtala;Juha Karkkainen;Hannu T.T. Toivonen

  • LZ77-Based Self-indexing with Faster Pattern Matching

    Travis Gagie;Pawel Gawrychowski;Juha Kärkkäinen;Yakov Nekrich

  • Colored range queries and document retrieval

    Travis Gagie;Juha Kärkkäinen;Gonzalo Navarro;Simon J. Puglisi

  • Linear Time Lempel-Ziv Factorization: Simple, Fast, Small

    Juha Kärkkäinen;Dominik Kempa;Simon J. Puglisi

  • Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform

    Djamal Belazzougui;Fabio Cunial;Juha Kärkkäinen;Veli Mäkinen

  • Colored range queries and document retrieval

    Travis Gagie;Gonzalo Navarro;Simon J. Puglisi

  • One-gapped q-gram filters for Levenshtein distance

    Stefan Burkhardt;Juha Kärkkäinen

  • One-Gapped q-Gram Filters for Levenshtein Distance

    Stefan Burkhardt;Juha Kärkkäinen

  • A Faster Grammar-Based Self-Index

    Travis Gagie;Paweł Gawrychowski;Juha Kärkkäinen;Yakov Nekrich

  • Approximate String Matching over Ziv-Lempel Compressed Text

    Juha Kärkkäinen;Gonzalo Navarro;Esko Ukkonen

  • Queries on LZ-Bounded Encodings

    Djamal Belazzougui;Travis Gagie;Pawel Gawrychowski;Juha Karkkainen

  • Better External Memory Suffix Array Construction

    Roman Dementiev;Juha Kärkkäinen;Jens Mehnert;Peter Sanders

Frequent Co-Authors

Simon J. Puglisi
Simon J. Puglisi University of Helsinki
gonzalo navarro
gonzalo navarro University of Chile
Veli Mäkinen
Veli Mäkinen University of Helsinki
Esko Ukkonen
Esko Ukkonen University of Helsinki
Peter Sanders
Peter Sanders Karlsruhe Institute of Technology
Hannu Toivonen
Hannu Toivonen University of Helsinki
Gad M. Landau
Gad M. Landau University of Haifa
Jens Stoye
Jens Stoye Bielefeld University
Maxime Crochemore
Maxime Crochemore King's College London
Erkki Sutinen
Erkki Sutinen University of Turku

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science can open doors to many related online degrees and flexible career pathways in the USA. If you are interested in a multidisciplinary approach, consider a bachelor of science in physics online. This can help you build a strong analytical foundation that complements computer science studies.

For those aiming to specialize further, pursuing the cheapest master in data science can provide crucial skills in big data, AI, and business analytics—fast-growing fields with competitive job prospects.

Alternatively, advancing your education in a technical discipline, such as electrical engineering, can lead to promising jobs in sectors like robotics, telecommunications, and energy. Discover the wide range of online electrical engineering career outcomes and see how they align with your aspirations.

If you are looking for faster entry into the workforce, consider earning easy licenses and certifications to get. These provide valuable credentials in a short time and can open the door to well-paying roles in IT and technology.

Best Scientists Citing Juha Kärkkäinen

Trending Scientists