11 - 20 out of 47Page size: 10
  1. 2011

  2. Boundary properties of graphs for algorithmic graph problems

    Korpelainen, N., Lozin, V. V., Malyshev, D. S. & Tiskin, A., 1 Jul 2011, In: Theoretical Computer Science. 412, 29, p. 3545-3554 10 p.

    Research output: Contribution to journal › Article › peer-review

  3. Towards approximate matching in compressed strings: Local subsequence recognition

    Tiskin, A., 23 Jun 2011, Computer Science – Theory and Applications (CSR 2011). p. 401-414 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6651).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  4. 2010

  5. Parallel selection by regular sampling

    Tiskin, A., 19 Nov 2010, Euro-Par 2010 - Parallel Processing (Euro-Par 2010). Vol. PART 2. p. 393-399 7 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6272).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  6. Evolutionary analysis of regulatory sequences (EARS) in plants

    Picot, E., Krusche, P., Tiskin, A., Carré, I. & Ott, S., 1 Oct 2010, In: Plant Journal. 64, 1, p. 165-176 12 p.

    Research output: Contribution to journal › Article › peer-review

  7. Parallel longest increasing subsequences in scalable time and memory

    Krusche, P. & Tiskin, A., 5 Aug 2010, Parallel Processing and Applied Mathematics (PPAM 2009). Vol. PART 1. p. 176-185 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6067).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  8. New algorithms for efficient parallel string comparison

    Krusche, P. & Tiskin, A., 30 Jul 2010, Annual ACM Symposium on Parallelism in Algorithms and Architectures. p. 209-216 8 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  9. Hamiltonian cycles in subcubic graphs: What makes the problem difficult

    Korpelainen, N., Lozin, V. V. & Tiskin, A., 15 Jul 2010, Theory and Applications of Models of Computation (TAMC 2010). p. 320-327 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6108).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  10. Computing alignment plots efficiently

    Krusche, P. & Tiskin, A., 1 Jan 2010, In: Advances in Parallel Computing. 19, p. 158-165 8 p.

    Research output: Contribution to journal › Article › peer-review

  11. Fast distance multiplication of unit-Monge matrices

    Tiskin, A., 1 Jan 2010, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. p. 1287-1296 10 p.

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

  12. 2009

  13. Periodic string comparison

    Tiskin, A., 9 Nov 2009, Combinatorial Pattern Matching (CPM 2009). p. 193-206 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5577 ).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Previous 1 2 3 4 5 Next

ID: 61693969