107 citations to https://www.mathnet.ru/rus/al201
-
Downey R., Melnikov A., Ng K.M., “Enumerating Abelian P-Groups”, J. Algebra, 560 (2020), 745–790
-
Brown T.A. Mcnicholl T.H. Melnikov A.G., “on the Complexity of Classifying Lebesgue Spaces”, J. Symb. Log., 85:3 (2020), PII S0022481220000638, 1254–1288
-
Downey R. Harrison-Trainor M. Kalimullin I. Melnikov A. Turetsky D., “Graphs Are Not Universal For Online Computability”, J. Comput. Syst. Sci., 112 (2020), 1–12
-
Bazhenov N. Goncharov S. Melnikov A., “Decompositions of Decidable Abelian Groups”, Int. J. Algebr. Comput., 30:1 (2020), 49–90
-
Rodney G. Downey, Alexander G. Melnikov, Lecture Notes in Computer Science, 12098, Beyond the Horizon of Computability, 2020, 100
-
С. Бояджийска, К. Ланге, Э. Раз, Р. Скэнлон, Дж. Воллбаум, Х. Чжан, “Классификации определимых подмножеств”, Алгебра и логика, 58:5 (2019), 574–608 ; S. Boyadzhiyska, K. Lange, A. Raz, R. Scanlon, J. Wallbaum, X. Zhang, “Classifications of definable subsets”, Algebra and Logic, 58:5 (2019), 383–404
-
М. В. Зубков, И. Ш. Калимуллин, А. Г. Мельников, А. Н. Фролов, “Пунктуальные копии алгебраических структур”, Сиб. матем. журн., 60:6 (2019), 1271–1285 ; M. V. Zubkov, I. Sh. Kalimullin, A. G. Mel'nikov, A. N. Frolov, “Punctual copies of algebraic structures”, Siberian Math. J., 60:6 (2019), 993–1002
-
Bazhenov N. Harrison-Trainor M. Kalimullin I. Melnikov A. Ng K.M., “Automatic and Polynomial-Time Algebraic Structures”, J. Symb. Log., 84:4 (2019), 1630–1669
-
Mahmoud M.A., “Degrees of Categoricity of Trees and the Isomorphism Problem”, Math. Log. Q., 65:3 (2019), 293–304
-
Downey R. Melnikov A. Ng K.M., “Categorical Linearly Ordered Structures”, Ann. Pure Appl. Log., 170:10 (2019), 1243–1255