Information Processing Letters

Research outputs

  1. 2019
  2. Published

    Strongly polynomial efficient approximation scheme for segmentation

    Tatti, N., 1 Feb 2019, In : Information Processing Letters. 142, p. 1-8 8 p.

    Research output: Contribution to journalArticleScientificpeer-review

  3. 2016
  4. Published

    A filtration method for order-preserving matching

    Chhabra, T. & Tarhio, J., 1 Feb 2016, In : Information Processing Letters. 116, 2, p. 71-74 4 p.

    Research output: Contribution to journalArticleScientificpeer-review

  5. 2015
  6. Published

    Impossible differential attack on 13-round Camellia-192

    Blondeau, C., 2015, In : Information Processing Letters. 115, 3, p. 660-666

    Research output: Contribution to journalArticleScientificpeer-review

  7. Published

    Longest common substrings with k mismatches

    Flouri, T., Giaquinta, E., Kobert, K. & Ukkonen, E., 2015, In : Information Processing Letters. 115, 6-8, p. 643-647

    Research output: Contribution to journalArticleScientificpeer-review

  8. Published

    On hypercube packings, blocking sets and a covering problem

    Kizhakkepallathu, A. M. & Östergård, P. R. J., 2015, In : Information Processing Letters. 115, 2, p. 141-145

    Research output: Contribution to journalArticleScientificpeer-review

  9. 2014
  10. Published

    Fast monotone summation over disjoint sets

    Kaski, P., Koivisto, M., Korhonen, J. H. & Sergeev, I. S., 2014, In : Information Processing Letters. 114, 5, p. 264-267

    Research output: Contribution to journalArticleScientificpeer-review

  11. 2013
  12. Published

    Counting closed trails

    Björklund, A. & Kaski, P., 2013, In : Information Processing Letters. 113, 1-2, p. 1-3

    Research output: Contribution to journalArticleScientificpeer-review

  13. 2012
  14. Published

    An Efficient Algorithm to Test Square-Freeness of Strings Compressed by Straight-Line Programs

    Bannai, H., Gagie, T., Tomohiro, I., Inenaga, S., Landau, G. M. & Lewenstein, M., 2012, In : Information Processing Letters. 112, 19, p. 711-714

    Research output: Contribution to journalArticleScientificpeer-review

  15. 2011
  16. Published

    Covering and packing in linear space

    Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2011, In : Information Processing Letters. 21-22, p. 1033--1036

    Research output: Contribution to journalArticleScientificpeer-review

  17. 2010
  18. Published

    Evaluation of permanents in rings and semirings

    Björklund, A., Husfeldt, T., Kaski, P. & Koivisto, M., 2010, In : Information Processing Letters. 110, 20, p. 867-870

    Research output: Contribution to journalArticleScientificpeer-review

  19. Published

    Improving practical exact string matching

    Durian, B., Holub, J., Peltola, H. & Tarhio, J., 2010, In : Information Processing Letters. 110, 4, p. 148-153

    Research output: Contribution to journalArticleScientificpeer-review

  20. 2009
  21. Published

    Approximating the minimum chain completion problem

    Feder, T., Mannila, H. & Terzi, E., 2009, In : Information Processing Letters. 109, 17, p. 980985

    Research output: Contribution to journalArticleScientificpeer-review

  22. Published

    A Randomized Approximation Algorithm for Computing Bucket Orders

    Ukkonen, A., Puolamäki, K., Gionis, A. & Mannila, H., 2009, In : Information Processing Letters. 109, 7, p. 356-359

    Research output: Contribution to journalArticleScientificpeer-review

  23. 2008
  24. Published

    An approximation ratio for biclustering

    Puolamäki, K., Hanhijärvi, S. & Garriga, G. C., 2008, In : Information Processing Letters. 108, 2, p. 45-49

    Research output: Contribution to journalArticleScientificpeer-review

  25. 2006
  26. Published

    Computational complexity of queries based on itemsets

    Tatti, N., 2006, In : Information Processing Letters. p. 183-187

    Research output: Contribution to journalArticleScientificpeer-review

  27. 2005
  28. Published

    Optimization, block designs and No Free Lunch theorems

    Griffiths, E. & Orponen, P., 2005, In : Information Processing Letters. 94, 2, p. 55-61

    Research output: Contribution to journalArticleScientificpeer-review

  29. Published

    Upper Bound for the Approximation Ratio of a Class of Hypercube Segmentation Algorithms

    Seppänen, J. K., 2005, In : Information Processing Letters. 93, 3, p. 139-141

    Research output: Contribution to journalArticleScientificpeer-review

  30. 2004
  31. Published

    Packing Steiner trees with identical terminal sets

    Kaski, P., 2004, In : Information Processing Letters. 91, 1, p. 1-5

    Research output: Contribution to journalArticleScientificpeer-review

  32. 1994
  33. Published

    An Efficient Transitive Closure Algorithm for Cyclic Digraphs

    Nuutila, E., 1994, In : Information Processing Letters. 52, p. 207-213

    Research output: Contribution to journalArticleScientificpeer-review

  34. Published

    On Finding the Strongly Connected Components in a Directed Graph

    Nuutila, E. & Soisalon-Soininen, E., 1994, In : Information Processing Letters. 49, p. 9-14

    Research output: Contribution to journalArticleScientificpeer-review

ID: 262931