1 - 10 out of 1,024Page size: 10
Sort by: Title

  1. $B$-точки канторовских множеств

    Мозоляко, П. А., 1 Jun 2022, In: ЗАПИСКИ НАУЧНЫХ СЕМИНАРОВ САНКТ-ПЕТЕРБУРГСКОГО ОТДЕЛЕНИЯ МАТЕМАТИЧЕСКОГО ИНСТИТУТА ИМ. В.А. СТЕКЛОВА РАН. 512

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

  2. 3-manifolds represented by 4-regular graphs with three Eulerian cycles

    Malyutin, A. V., Fominykh, E. A. & Shumakova, E. V., 1 Dec 2021, In: Russian Mathematical Surveys. 76, 6, p. 1143-1145 3 p.

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

  3. 3-многообразия, задаваемые 4-регулярными графами с тремя эйлеровыми циклами

    Малютин, А. В., Фоминых, Е. А. & Шумакова, Е. В., 2021, In: УСПЕХИ МАТЕМАТИЧЕСКИХ НАУК. 76, 6, p. 197-198

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

  4. 5-point CAT(0) spaces after Tetsu Toyoda

    Lebedeva, N. & Petrunin, A., 1 Jan 2021, In: Analysis and Geometry in Metric Spaces. 9, 1, p. 160-166 7 p.

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

  5. A 2|E|/4-time algorithm for max-cut

    Kulikov, A. S. & Fedin, S. S., 1 Jan 2005, In: Journal of Mathematical Sciences . 126, 3, p. 1200-1204 5 p.

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

  6. A 5n - o(n) lower bound on the circuit size over U 2 of a linear Boolean function

    Kulikov, A. S., Melanich, O. & Mihajlin, I., 18 Jun 2012, How the World Computes - Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Proceedings. p. 432-439 8 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7318 LNCS).

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

  7. Abelian closures of infinite binary words

    Puzynina, S. & Whiteland, M. A., Jan 2022, In: Journal of Combinatorial Theory. Series A. 185, 37 p., 105524.

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

  8. Abelian combinatorics on words: A survey.

    Fici, G. & Puzynina, S., Feb 2023, In: Computer Science Review. 47, 100532.

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

  9. Abelian Properties of Words

    Puzynina, S., 1 Jan 2019, Combinatorics on Words: 12th International Conference, WORDS 2019, Proceedings. Mercas, R. & Reidenbach, D. (eds.). Springer Nature, p. 28-45 (Lecture Notes in Computer Science ; vol. 11682 ).

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

  10. A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function

    Find, M. G., Golovnev, A., Hirsch, E. A. & Kulikov, A. S., 14 Dec 2016, Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. Institute of Electrical and Electronics Engineers Inc., p. 89-98 10 p. 7782921. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2016-December).

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

Previous 1 2 3 4 5 6 7 8 ...103 Next

ID: 45528956