1 - 10 out of 10Page size: 10
  1. 2022

  2. Colourings of exceptional uniform polytopes of types E_6 and E_7

    Вавилов, Н. А. & Мигрин, В. В., Dec 2022, In: ЗАПИСКИ НАУЧНЫХ СЕМИНАРОВ САНКТ-ПЕТЕРБУРГСКОГО ОТДЕЛЕНИЯ МАТЕМАТИЧЕСКОГО ИНСТИТУТА ИМ. В.А. СТЕКЛОВА РАН. 517, p. 36-54 19 p.

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

  3. 2021

  4. State Complexity of Union and Intersection on Graph-Walking Automata

    Martynova, O. & Okhotin, A., 30 Dec 2021, Descriptional Complexity of Formal Systems - 23rd IFIP WG 1.02 International Conference, DCFS 2021, Proceedings. Han, Y-S. & Ko, S-K. (eds.). Springer Nature, p. 125-136 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 13037 LNCS).

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

  5. Enhanced Dynkin diagrams done right

    Vavilov, N. & Migrin, V., Jul 2021, In: ЗАПИСКИ НАУЧНЫХ СЕМИНАРОВ САНКТ-ПЕТЕРБУРГСКОГО ОТДЕЛЕНИЯ МАТЕМАТИЧЕСКОГО ИНСТИТУТА ИМ. В.А. СТЕКЛОВА РАН. 500, p. 11-29

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

  6. On the Length of Shortest Strings Accepted by Two-way Finite Automata

    Dobronravov, E., Dobronravov, N. & Okhotin, A., 30 Jun 2021, In: Fundamenta Informaticae. 180, 4, p. 315-331 17 p.

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

  7. Exceptional uniform polytopes of the E_6, E_7 and E_8 symmetry types

    Migrin, V. & Vavilov, N., 18 Apr 2021. 23 p.

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

  8. Dynamics of a Continual Sociological Model

    Pilyugin, S. Y. & Sabirova, D. Z., Apr 2021, In: Vestnik St. Petersburg University: Mathematics. 54, 2, p. 196-205 10 p.

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

  9. Lower bounds for graph-walking automata

    Martynova, O. & Okhotin, A., 1 Mar 2021, 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021. Blaser, M. & Monmege, B. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13 p. 52. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 187).

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

  10. Alternative proof of upper bound of spanning trees in a graph

    Chelpanov, K. V., 27 Feb 2021, p. 1-4, 4 p.

    Research output: Working paper › Preprint

  11. Школьные олимпиады СПбГУ 2020. Информатика

    Трофимов, В. В., Мельников, В. В., Стариков, Д. А., Акимова, А. Н. & Иванов, М. П., 2021, Издательство Санкт-Петербургского университета. 56 p.

    Research output: Book/Report/Anthology › Teaching materials

  12. 2019

  13. On the length of shortest strings accepted by two-way finite automata

    Dobronravov, E., Dobronravov, N. & Okhotin, A., 1 Jan 2019, Developments in Language Theory - 23rd International Conference, DLT 2019, Proceedings. Hofman, P. & Skrzypczak, M. (eds.). Springer Nature, p. 88-99 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11647 LNCS).

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

ID: 9403679