1. 2006
  2. Bulk-Synchronous Parallelism: An Emerging Paradigm of High-Performance Computing

    Tiskin, A., 23 Jan 2006, High-Performance Computing: Paradigm and Infrastructure. p. 69-80 12 p.

    Research output: Chapter in Book/Report/Conference proceedingChapterResearchpeer-review

  3. All semi-local longest common subsequences in subquadratic time

    Tiskin, A., 1 Jan 2006, Computer Science – Theory and Applications (CSR 2006). p. 352-363 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3967).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  4. Clause shortening combined with pruning yields a new upper bound for deterministic SAT algorithms

    Dantsin, E., Hirsch, E. A. & Wolpert, A., 1 Jan 2006, Algorithms and Complexity - 6th Italian Conference, CIAC 2006, Proceedings. Springer Nature, p. 60-68 9 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3998 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  5. Complexity of semialgebraic proofs with restricted degree of falsity

    Kojevnikov, A. & Kulikov, A. S., 1 Jan 2006, Theory and Applications of Satisfiability Testing, SAT 2006 - 9th International Conference, Proceedings. Springer Nature, p. 11-21 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4121 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

  6. 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 proceedingConference contributionResearchpeer-review

  7. Isogeny classes of formal groups over complete discrete valuation fields with arbitrary residue fields

    Bondarko, M. V., 1 Jan 2006, In: St. Petersburg Mathematical Journal. 17, 6, p. 975-988 14 p.

    Research output: Contribution to journalArticlepeer-review

  8. 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 proceedingConference contributionResearchpeer-review

  9. 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 proceedingConference contributionResearchpeer-review

  10. On the number of rational points on a strictly convex curve

    Petrov, F. V., 1 Jan 2006, In: Functional Analysis and its Applications. 40, 1, p. 24-33 10 p.

    Research output: Contribution to journalArticlepeer-review

  11. Undecidability in the homomorphic quasiorder of finite labeled forests

    Kudinov, O. V. & Selivanov, V. L., 1 Jan 2006, Logical Approaches to Computational Barriers (CiE 2006). p. 289-296 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 3988).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

ID: 45528956