2017

1. Nikolai Vavilov, Pavel Gvozdevsky, Daniil Mamaev, Recent results on intermediate subgroups of classical groups. 4th Biennial International Group Theory Conference 2017(4BIGTC2017) January. 23-26 (2017), pp. 44-46. UTM Kuala Lampur, Malaysia [full text]

2018

1. Bakinova E., Basharin A., Batmanov I., Lyubort K., Okhotin A., Sazhneva E. (2018) Formal Languages over GF(2). In: Klein S., Martín-Vide C., Shapira D. (eds) Language and Automata Theory and Applications. LATA 2018. Lecture Notes in Computer Science, vol 10792. Springer, Cham.

2019

1. Elena Arseneva, John Iacono, Greg Koumoutsos, Stefan Langerman, Boris Zolotov, Sublinear Explicit Incremental Planar Voronoi Diagrams, In proceedings of the Japan Conference on Discrete and Computational Geometry, Graphs, and Games, September 2019 [full text]
2. Elena Arseneva, Stefan Langerman, Boris Zolotov, A complete list of all convex polyhedra made by gluing regular pentagons, In proceedings of the Japan Conference on Discrete and Computational Geometry, Graphs, and Games, September 2019 [full text]
3. Dobronravov E., Dobronravov N., Okhotin A. (2019) On the Length of Shortest Strings Accepted by Two-Way Finite Automata. In: Hofman P., Skrzypczak M. (eds) Developments in Language Theory. DLT 2019. Lecture Notes in Computer Science, vol 11647. Springer, Cham. 
4. Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova, Bounded-depth Frege complexity of Tseitin formulas for all graphs, MFCS 2019: 49:1–49:15 
5. Makarov, V., & Okhotin, A. (2019). On the expressive power of GF(2)-grammars. В R. Královič, G. Pighizzini, J. Nawrocki, & B. Catania (Ред.), SOFSEM 2019: Theory and Practice of Computer Science — 45th International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings (стр. 310-323). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 11376 LNCS). 
6. Okhotin A., Sazhneva E. (2019) State Complexity of GF(2)-Concatenation and GF(2)-Inverse on Unary Languages. In: Hospodár M., Jirásková G., Konstantinidis S. (eds) Descriptional Complexity of Formal Systems. DCFS 2019. Lecture Notes in Computer Science, vol 11612. Springer, Cham. 
7. В. Ю. Евтушевский, “Перечисление путей в графе Юнга–Фибоначчи”, Теория представлений, динамические системы, комбинаторные и алгоритмические методы. XXX, Зап. научн. сем. ПОМИ, 481, ПОМИ, СПб., 2019, 39–62 

2020

1. Y. Alekseev, D. Grigoriev, E. A. Hirsch, I. Tzameret. STOC 2020: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. June 2020. Pages 54–67. 
2. Tatiana Belova, Ivan Bliznets, Algorithms for (n,3)-MAXSAT and parameterization above the all-true assignment, Theoretical Computer Science, Volume 803, 2020, Pages 222-233. 
3. Yurii Belov, Alexander Borichev, Alexander Kuznetsov, Upper and lower densities of Gabor Gaussian systems, Applied and Computational Harmonic Analysis, Volume 49, Issue 2, 2020, Pages 438-450 
4. M. I. Belishev, N. D. Filonov, S. T. Krymskiy & A. F. Vakulenko (2020) On uniqueness of continuation for polynomials of solutions to second-order elliptic PDE, Applicable Analysis, DOI: 10.1080/00036811.2019.1703959
5. Ivan Bochkov, Polynomial Birth–Death Processes and the 2nd Conjecture of Valent, International Mathematics Research Notices, 2020;, rnz346 
6. Bochkov, I.A., Petrov, F.V. The Bounds for the Number of Linear Extensions Via Chain and Antichain Coverings. Order (2020).
7. A. Enin, P. Perstneva, S. Tikhomirov, “Periodic solutions of parabolic equations with hysteresis in the dimension 1”, Boundary-value problems of mathematical physics and related problems of function theory. Part 48, Zap. Nauchn. Sem. POMI, 489, POMI, St. Petersburg, 2020, 36–54 
8. Krymski S., Okhotin A. (2020) Longer Shortest Strings in Two-Way Finite Automata. In: Jirásková G., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2020. Lecture Notes in Computer Science, vol 12442. Springer, Cham. 
9. Aleksei Kulikov, On the Heins theorem. Studia Mathematica 252 (2020), 299-310 
10. D. Mamaev, Oriented Area as a Morse Function on Polygon Spaces, Ars Mathematica Contemporanea, vol. 19, No 1 (2020), 155–171  arXiv: 2001.02707 
11. Monakov, G.V., Tikhomirov, S.B. & Yakovlev, A.A. Displacement of Viscous Fluids in a Set of Parallel Pipes. Comput. Math. and Math. Phys. 60, 484–497 (2020).
12. T. D. Moseeva, “Distribution of the volume of weighted Gaussian simplex”, Probability and statistics. Part 29, Zap. Nauchn. Sem. POMI, 495, POMI, St. Petersburg, 2020, 187–197.  arXiv: 2007.07208  
13. Mikhail Mrykhin, Alexander Okhotin, The hardest language for grammars with context operators,  arXiv: 2012.03596
14. Okhotin A., Olkhovsky I. (2020) On the Transformation of LL(k)-linear Grammars to LL(1)-linear. In: Fernau H. (eds) Computer Science – Theory and Applications. CSR 2020. Lecture Notes in Computer Science, vol 12159. Springer, Cham. 
15. Yaroslav Alekseev. «A Lower Bound for Polynomial Calculus with Extension Rule»,  arXiv: 2010.05660
16. Petrov, F., Tarasov, A. Uniqueness of a Three-Dimensional Ellipsoid with Given Intrinsic Volumes. Arnold Math J. 6, 163–171 (2020). 
17. Veprev, G.A. Estimating the Asymptotic Behavior of the Entropy of an Invariant Sequence of Partitions of the Infinite-Dimensional Cube. J Math Sci 247, 641–645 (2020).  
18. G. Veprev, «Non-existence of a universal zero entropy system for non-periodic amenable group actions», arXiv: 2010.09806
19. G. Veprev, “Scaling entropy of unstable systems”, Зап. научн. сем. ПОМИ, 498 (2020), 5–17
20. Д. И. Блинова, М. А. Лифшиц, “Энергия натянутых струн, сопровождающих винеровский процесс и случайное блуждание в полосе переменной ширины”, Вероятность и статистика. 29, Зап. научн. сем. ПОМИ, 495, ПОМИ, СПб., 2020, 64–86 
21. Востоков С.В., Шашков Т.Ю., Афанасьева С.С. Интеграл Шнирельмана и аналог интегральной теоремы Коши для двумерных локальных полей. Чебышевский сборник. 2020;21(3):39-58. 
22. Заляпин, В.И., Шалгин В.С. Метод интегральных уравнений для векторной обратной задачи / Вестник Южно-Уральского государственного университета. Серия «Математика. Механика. Физика». 2020, Т. 12, № 4, С. 19–27. 
23. М. П. Иванов, «Точная оценка на количество правильных 3-раскрасок рёбер связного кубического графа», Зап. научн. сем. ПОМИ, 497 (2020), стр. 26-52

2021

1. Akhtiamov, D., Ivanov, S.O. & Pavutnitskiy, F. Right exact localizations of groups. Isr. J. Math. (2021). 
2. Dementiev Y., Ignatiev A., Sidelnik V., Smal A., Ushakov M. (2021) New Bounds on the Half-Duplex Communication Complexity. In: Bureš T. et al. (eds) SOFSEM 2021: Theory and Practice of Computer Science. SOFSEM 2021. Lecture Notes in Computer Science, vol 12607. Springer, Cham. 
3. Kislyakov, S.V., Perstneva, P.S. Indicator Functions with Uniformly Bounded Fourier Sums and Large Gaps in the Spectrum. J Fourier Anal Appl 27, 33 (2021).  arXiv: 2006.02561 
4. Kulikov, A. (2021), A contractive Hardy–Littlewood inequality. Bull. London Math. Soc. 
5. Stanislav Krymski, Michael Levitin, Leonid Parnovski, Iosif Polterovich, David A Sher, Inverse Steklov Spectral Problem for Curvilinear Polygons, International Mathematics Research Notices, Volume 2021, Issue 1, January 2021, Pages 1–37. 
6. Ilya Losev, Jacobi matrices with lacunary spectrum, Journal of Mathematical Analysis and Applications, Volume 503, Issue 1, 2021, 125300. 
7. Olga Martynova, Alexander Okhotin, «Lower bounds for graph-walking automata», 38th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2021, 16—19 March 2021), LIPIcs 187, 52:1-52:13. 
8. Mrykhin M., Okhotin A. (2021) On Hardest Languages for One-Dimensional Cellular Automata. In: Leporati A., Martín-Vide C., Shapira D., Zandron C. (eds) Language and Automata Theory and Applications. LATA 2021. Lecture Notes in Computer Science, vol 12638. Springer, Cham. 
9. Anastasia Sofronova, Dmitry Sokolov, «Branching Programs with Bounded Repetitions and Flow Formulas», Electronic Colloquium on Computational Complexity, Report No. 28 (2021) [full text]
10. Ю. С. Белоусов, М. В. Карев, А. В. Малютин, А. Ю. Миллер, Е. А. Фоминых, “Лернейские узлы и вложенные перестройки”, Алгебра и анализ, 33:1 (2021), 30–66. 
11. Н. Филонов, П. А. Ходунов, “Неединственность решения Лерэ–Хопфа для диадической модели”, Алгебра и анализ, 32:2 (2020), 229–253; St. Petersburg Math. J., 32:2 (2021), 371–387  

Preprints

1. Danil Akhtiamov, Homologies of inverse limits of groups,  arXiv: 1901.01125 
2. Ilya Alekseev, «New classes of minimal knot diagrams»,  arXiv: 2012.04330
3. Alekseev, I., Magdiev R., The language of geodesics for the discrete Heisenberg group.  arXiv: 1905.03226 
4. Alekseev, I., & Mamedov, G., On minimal crossing number braid diagrams and homogeneous braids.  arXiv: 1905.03210
5. Yaroslav Alekseev. «A Lower Bound for Polynomial Calculus with Extension Rule»,  arXiv: 2010.05660
6. Ivan Bochkov, Alex Davydow, Nikita Gaevoy, Sergey I. Nikolenko, New Competitiveness Bounds for the Shared Memory Switch.  arXiv: 1907.04399
7. K. V. Chelpanov, «Alternative proof of upper bound of spanning trees in a graph»,  arXiv: 2103.00310
8. Youri Davydov, Svyatoslav Novikov, Remarks on asymptotic independence.  arXiv: 1910.04243
9. A. Kulikov, Fourier interpolation and time-frequency localization.  arXiv: 2005.12836
10. Daniel Lenz, Timon Weinmann, Melchior Wirth, Self-Adjoint Extensions of Bipartite Hamiltonians together with Daniel Lenz and Melchior Wirth.  arXiv: 1912.03670
11. Tatiana Moseeva, Alexander Tarasov, Dmitry Zaporozhets, Random sections of spherical convex bodies.  arXiv: 2007.07297
12. A. Nordskova, Y.Volkov, Faithful actions of braid groups by twists along ADE-configurations of spherical objects.  arXiv: 1910.02401
13. G. Veprev, «Non-existence of a universal zero entropy system for non-periodic amenable group actions», arXiv: 2010.09806