L. N. Coregliano, M. Malliaris, “Weak randomness in graphons and theons”, Random Struct Algorithms, 66:1 (2025), e21261
Henry Towsner, “A removal lemma for ordered hypergraphs”, Proceedings of London Math Soc, 130:1 (2025)
Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Amit Levi, Gopinath Mishra, Sayantan Sen, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025, 1007
E. Egorova, V. Leonov, A. Mokryakov, V. Tsurkov, “Finding set extreme 3-uniform hypergraphs cardinality through second-order signatures”, Axioms, 13:6 (2024), 364
Т. Ю. Гольцова, Е. К. Егорова, В. Ю. Леонов, А. В. Мокряков, “Сигнатуры первого и второго порядков экстремальных однородных гиперграфов и их связь с векторами степеней вершин”, Известия Российской академии наук. Теория и системы управления, 2023, № 4, 84 ; T. Yu. Goltsova, E. K. Egorova, V. Yu. Leonov, A. V. Mokryakov, “First and second order signatures of extreme uniform hypergraphs and their relationship with vectors of the vertex degrees”, J. Comput. Syst. Sci. Int., 62:4 (2023), 675
S. Chatterjee, P. Diaconis, G. B. Kim, “Enumerative theory for the Tsetlin library”, Journal of Algebra, 2023
P. Dodos, K. Tyros, P. Valettas, “Concentration estimates for functions of finite high.dimensional random arrays”, Random Struct Algorithms, 63:4 (2023), 997–1053
L. N. Coregliano, “On the abstract chromatic number and its computability for finitely axiomatizable theories”, J. Comb. Theory Ser. B, 154 (2022), 175–210
A. Coja-Oghlan, M. Hahn-Klimroth, “The cut metric for probability distributions”, SIAM J. Discrete Math., 35:2 (2021), 1096–1135
Trends in Mathematics, 14, Extended Abstracts EuroComb 2021, 2021, 273