The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Juha Kärkkäinen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen
    Efficient Discovery of Functional and Approximate Dependencies Using Partitions. [Citation Graph (3, 12)][DBLP]
    ICDE, 1998, pp:392-401 [Conf]
  2. Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitrios Gunopulos, Juha Kärkkäinen
    Episode Matching. [Citation Graph (1, 0)][DBLP]
    CPM, 1997, pp:12-27 [Conf]
  3. Ykä Huhtala, Juha Kärkkäinen, Pasi Porkka, Hannu Toivonen
    TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. [Citation Graph (1, 0)][DBLP]
    Comput. J., 1999, v:42, n:2, pp:100-111 [Journal]
  4. Roman Dementiev, Juha Kärkkäinen, Jens Mehnert, Peter Sanders
    Better External Memory Suffix Array Construction. [Citation Graph (0, 0)][DBLP]
    ALENEX/ANALCO, 2005, pp:86-97 [Conf]
  5. Juha Kärkkäinen, Esko Ukkonen
    Sparse Suffix Trees. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:219-230 [Conf]
  6. Stefan Burkhardt, Juha Kärkkäinen
    Better Filtering with Gapped q-Grams. [Citation Graph (0, 0)][DBLP]
    CPM, 2001, pp:73-85 [Conf]
  7. Stefan Burkhardt, Juha Kärkkäinen
    One-Gapped q-Gram Filtersfor Levenshtein Distance. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:225-234 [Conf]
  8. Stefan Burkhardt, Juha Kärkkäinen
    Fast Lightweight Suffix Array Construction and Checking. [Citation Graph (0, 0)][DBLP]
    CPM, 2003, pp:55-69 [Conf]
  9. Juha Kärkkäinen
    Suffix Cactus: A Cross between Suffix Tree and Suffix Array. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:191-204 [Conf]
  10. Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen
    Approximate String Matching over Ziv-Lempel Compressed Text. [Citation Graph (0, 0)][DBLP]
    CPM, 2000, pp:195-209 [Conf]
  11. Juha Kärkkäinen, S. Srinivasa Rao
    Full-Text Indexes in External Memory. [Citation Graph (0, 0)][DBLP]
    Algorithms for Memory Hierarchies, 2002, pp:149-170 [Conf]
  12. Juha Kärkkäinen, Erkki Sutinen
    Lempel-Ziv Index for q-Grams. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:378-391 [Conf]
  13. Juha Kärkkäinen, Peter Sanders
    Simple Linear Work Suffix Array Construction. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:943-955 [Conf]
  14. Juha Kärkkäinen, Esko Ukkonen
    Two and Higher Dimensional Pattern Matching in Optimal Expected Time. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:715-723 [Conf]
  15. Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen
    BDD-Based Analysis of Gapped q-Gram Filters. [Citation Graph (0, 0)][DBLP]
    Stringology, 2004, pp:56-68 [Conf]
  16. Juha Kärkkäinen
    Computing the Threshold for q-Gram Filters. [Citation Graph (0, 0)][DBLP]
    SWAT, 2002, pp:348-357 [Conf]
  17. Juha Kärkkäinen, Erkki Sutinen
    Lempel-Ziv Index for q-Grams. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1998, v:21, n:1, pp:137-154 [Journal]
  18. Stefan Burkhardt, Juha Kärkkäinen
    Better Filtering with Gapped q-Grams. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:56, n:1-2, pp:51-70 [Journal]
  19. Marc Fontaine, Stefan Burkhardt, Juha Kärkkäinen
    Bdd-based analysis of gapped q-gram Filters. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:6, pp:1121-1134 [Journal]
  20. Juha Kärkkäinen, Peter Sanders, Stefan Burkhardt
    Linear work suffix array construction. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:6, pp:918-936 [Journal]
  21. Juha Kärkkäinen, Gonzalo Navarro, Esko Ukkonen
    Approximate string matching on Ziv-Lempel compressed text. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:3-4, pp:313-338 [Journal]
  22. Juha Kärkkäinen, Esko Ukkonen
    Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:2, pp:571-589 [Journal]
  23. Juha Kärkkäinen, Joong Chae Na
    Faster Filters for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  24. Juha Kärkkäinen
    Alphabets in generic programming. [Citation Graph (0, 0)][DBLP]
    Stringology, 2005, pp:163-173 [Conf]

  25. Permuted Longest-Common-Prefix Array. [Citation Graph (, )][DBLP]


  26. Medium-Space Algorithms for Inverse BWT. [Citation Graph (, )][DBLP]


  27. Engineering Radix Sort for Strings. [Citation Graph (, )][DBLP]


Search in 0.100secs, Finished in 0.101secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002