The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Kimmo Fredriksson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Stefan Burkhardt, Kimmo Fredriksson, Tuomas Ojamies, Janne Ravantti, Esko Ukkonen
    Local Approximate 3D Matching of Proteins in Viral Cryo-EM Density Maps. [Citation Graph (0, 0)][DBLP]
    3DPVT, 2004, pp:979-986 [Conf]
  2. Kimmo Fredriksson, Gonzalo Navarro
    Average-Optimal Multiple Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2003, pp:109-128 [Conf]
  3. Kimmo Fredriksson, Gonzalo Navarro
    Improved Single and Multiple Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 2004, pp:457-471 [Conf]
  4. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
    Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations. [Citation Graph (0, 0)][DBLP]
    CPM, 2002, pp:235-248 [Conf]
  5. Kimmo Fredriksson, Esko Ukkonen
    A Rotation Invariant Filter for Two-Dimensional String Matching. [Citation Graph (0, 0)][DBLP]
    CPM, 1998, pp:118-125 [Conf]
  6. Kimmo Fredriksson, Esko Ukkonen
    Faster template matching without FFT. [Citation Graph (0, 0)][DBLP]
    ICIP (1), 2001, pp:678-681 [Conf]
  7. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
    An Index for Two Dimensional String Matching Allowing Rotations. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:59-75 [Conf]
  8. Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro
    Rotation and Lighting Invariant Template Matching. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:39-48 [Conf]
  9. Kimmo Fredriksson
    Faster String Matching with Super-Alphabets. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2002, pp:44-57 [Conf]
  10. Kimmo Fredriksson
    Rotation Invariant Histogram Filters for Similarity and Distance Measures between Digital Images. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2000, pp:105-115 [Conf]
  11. Kimmo Fredriksson
    Row-wise Tiling for the Myers' Bit-Parallel Approximate String Matching Algorithm. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2003, pp:66-79 [Conf]
  12. Kimmo Fredriksson
    Metric Indexes for Approximate String Matching in a Dictionary. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2004, pp:212-213 [Conf]
  13. Kimmo Fredriksson, Szymon Grabowski
    Practical and Optimal String Matching. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:376-387 [Conf]
  14. Kimmo Fredriksson, Szymon Grabowski
    Efficient Algorithms for Pattern Matching with General Gaps and Character Classes. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2006, pp:267-278 [Conf]
  15. Kimmo Fredriksson, Jorma Tarhio
    Processing of Huffman Compressed Texts with a Super-Alphabet. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2003, pp:108-121 [Conf]
  16. Kimmo Fredriksson, Esko Ukkonen
    Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2000, pp:96-104 [Conf]
  17. Maxim Mozgovoy, Kimmo Fredriksson, Daniel R. White, Mike Joy, Erkki Sutinen
    Fast Plagiarism Detection System. [Citation Graph (0, 0)][DBLP]
    SPIRE, 2005, pp:267-270 [Conf]
  18. Kimmo Fredriksson, Szymon Grabowski
    Efficient algorithms for (delta, gamma, alpha)-matching. [Citation Graph (0, 0)][DBLP]
    Stringology, 2006, pp:29-40 [Conf]
  19. Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro
    Increased Bit-Parallelism for Approximate String Matching. [Citation Graph (0, 0)][DBLP]
    WEA, 2004, pp:285-298 [Conf]
  20. Kimmo Fredriksson, Szymon Grabowski
    Efficient Bit-Parallel Algorithms for (delta, alpha)-Matching. [Citation Graph (0, 0)][DBLP]
    WEA, 2006, pp:170-181 [Conf]
  21. Kimmo Fredriksson, Jorma Tarhio
    Efficient String Matching in Huffman Compressed Texts. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:63, n:1, pp:1-16 [Journal]
  22. Kimmo Fredriksson
    On-line Approximate String Matching in Natural Language. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:72, n:4, pp:453-466 [Journal]
  23. Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro
    Flexible Music Retrieval in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:6, pp:1345-1364 [Journal]
  24. Kimmo Fredriksson
    Shift-or string matching with super-alphabets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:4, pp:201-204 [Journal]
  25. Kimmo Fredriksson
    Exploiting distance coherence to speed up range queries in metric indexes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:1, pp:287-292 [Journal]
  26. Kimmo Fredriksson, Maxim Mozgovoy
    Efficient parameterized string matching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:3, pp:91-96 [Journal]
  27. Kimmo Fredriksson, Szymon Grabowski
    A general compression algorithm that supports fast searching. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:100, n:6, pp:226-232 [Journal]
  28. Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Navarro
    Increased bit-parallelism for approximate and multiple string matching. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2005, v:10, n:, pp:- [Journal]
  29. Kimmo Fredriksson, Gonzalo Navarro
    Average-optimal single and multiple approximate string matching. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2004, v:9, n:, pp:- [Journal]
  30. Kimmo Fredriksson, Esko Ukkonen
    Combinatorial methods for approximate image matching under translations and rotations. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 1999, v:20, n:11-13, pp:1249-1258 [Journal]
  31. Kimmo Fredriksson
    Engineering efficient metric indexes. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition Letters, 2007, v:28, n:1, pp:75-84 [Journal]
  32. Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
    Sequential and indexed two-dimensional combinatorial template matching allowing rotations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:239-275 [Journal]
  33. Gonzalo Navarro, Kimmo Fredriksson
    Average complexity of exact and approximate multiple string matching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:321, n:2-3, pp:283-290 [Journal]
  34. Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro
    Flexible music retrieval in sublinear time. [Citation Graph (0, 0)][DBLP]
    Stringology, 2005, pp:174-189 [Conf]
  35. Karina Figueroa, Kimmo Fredriksson
    Simple Space-Time Trade-Offs for AESA. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:229-241 [Conf]
  36. Kimmo Fredriksson, Fedor Nikitin
    Simple Compression Code Supporting Random Access and Fast String Matching. [Citation Graph (0, 0)][DBLP]
    WEA, 2007, pp:203-216 [Conf]
  37. Kimmo Fredriksson, Veli Mäkinen, Gonzalo Navarro
    Rotation and lighting invariant template matching. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2007, v:205, n:7, pp:1096-1113 [Journal]

  38. From Nondeterministic Suffix Automaton to Lazy Suffix Tree. [Citation Graph (, )][DBLP]


  39. Nested Counters in Bit-Parallel String Matching. [Citation Graph (, )][DBLP]


  40. Fast Convolutions and Their Applications in Approximate String Matching. [Citation Graph (, )][DBLP]


  41. Speeding Up Permutation Based Indexing with Indexing. [Citation Graph (, )][DBLP]


  42. On building minimal automaton for subset matching queries [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.153secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002