31 - 40 out of 47Page size: 10
  1. 2006

  2. Efficient longest common subsequence computation using bulk-synchronous parallelism

    Krusche, P. & Tiskin, A., 1 Jan 2006, Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006). p. 165-174 10 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3984).

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

  3. Longest common subsequences in permutations and maximum cliques in circle graphs

    Tiskin, A., 1 Jan 2006, Combinatorial Pattern Matching (CPM 2006). p. 270-281 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4009).

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

  4. One-sided monge TSP Is NP-hard

    Deineko, V. & Tiskin, A., 1 Jan 2006, Computational Science and Its Applications - ICCSA 2006 (ICCSA 2006). p. 793-801 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3982).

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

  5. 2004

  6. Dynamic BSP: Towards a flexible approach to parallel computing over the grid

    Martin, J. M. R. & Tiskin, A. V., 14 Oct 2004, In: Concurrent Systems Engineering Series. 62, p. 219-226 8 p.

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

  7. Communication lower bounds for distributed-memory matrix multiplication

    Irony, D., Toledo, S. & Tiskin, A., 1 Jan 2004, In: Journal of Parallel and Distributed Computing. 64, 9, p. 1017-1026 10 p.

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

  8. 2003

  9. Communication-efficient parallel Gaussian elimination

    Tiskin, A., 1 Jan 2003, Parallel Computing Technologies (PaCT 2003). p. 369-383 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2763).

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

  10. 2002

  11. Bulk-synchronous parallel gaussian elimination

    Tiskin, A., 1 Jan 2002, In: Journal of Mathematical Sciences . 108, 6, p. 977-991 15 p.

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

  12. Parallel convex hull computation by generalised regular sampling

    Tiskin, A., 1 Jan 2002, Euro-Par 2002. Parallel Processing: 8th International Euro-Par Conference Paderborn, Germany, August 27-30, 2002 Proceedings. Springer Nature, p. 392-399 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2400).

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

  13. Parallel priority queue and list contraction: The BSP approach

    Gerbessiotis, A. V., Siniolakis, C. J. & Tiskin, A., 1 Jan 2002, In: Computing and Informatics. 21, 1, p. 59-90 32 p.

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

  14. 2001

  15. All-pairs shortest paths computation in the BSP model

    Tiskin, A., 1 Jan 2001, Automata, Languages and Programming (ICALP 2001). p. 178-189 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2076).

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

Previous 1 2 3 4 5 Next

ID: 61693969