831 - 840 out of 1,019Page size: 10
  1. 2006

  2. Traces on infinite-dimensional Brauer algebras

    Nikitin, P. P. & Vershik, A. M., 1 Jul 2006, In: Functional Analysis and its Applications. 40, 3, p. 165-172 8 p.

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

  3. Convergence of discretized attractors for parabolic equations on the line

    Beyn, W. J., Kolezhuk, V. S. & Pilyugin, S. Y., Jul 2006, In: Journal of Mathematical Sciences . 136, 2, p. 3655-3671 17 p.

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

  4. Spectral asymptotics of pauli operators and orthogonal polynomials in complex domains

    Filonov, N. & Pushnitski, A., 1 Jun 2006, In: Communications in Mathematical Physics. 264, 3, p. 759-772 14 p.

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

  5. Automated proofs of upper bounds on the running time of splitting algorithms

    Fedin, S. S. & Kulikov, A. S., 1 May 2006, In: Journal of Mathematical Sciences . 134, 5, p. 2383-2391 9 p.

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

  6. A new approach to proving upper bounds for MAX-2-SAT

    Kojevnikov, A. & Kulikov, A. S., 28 Feb 2006, p. 11-17. 7 p.

    Research output: Contribution to conference › Paper › peer-review

  7. Modularity of a certain Calabi-Yau threefold and combinatorial congruences

    Mortenson, E., 1 Feb 2006, In: Ramanujan Journal. 11, 1, p. 5-39 35 p.

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

  8. 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 proceeding › Chapter › Research › peer-review

  9. 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 proceeding › Conference contribution › Research › peer-review

  10. 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 proceeding › Conference contribution › Research › peer-review

  11. 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 proceeding › Conference contribution › Research › peer-review

Previous 1...80 81 82 83 84 85 86 87 ...102 Next

ID: 45528956