Alexander Melnikov

1.6k total citations
64 papers, 426 citations indexed

About

Alexander Melnikov is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Alexander Melnikov has authored 64 papers receiving a total of 426 indexed citations (citations by other indexed papers that have themselves been cited), including 58 papers in Computational Theory and Mathematics, 34 papers in Geometry and Topology and 10 papers in Artificial Intelligence. Recurrent topics in Alexander Melnikov's work include Computability, Logic, AI Algorithms (58 papers), semigroups and automata theory (36 papers) and Advanced Topology and Set Theory (34 papers). Alexander Melnikov is often cited by papers focused on Computability, Logic, AI Algorithms (58 papers), semigroups and automata theory (36 papers) and Advanced Topology and Set Theory (34 papers). Alexander Melnikov collaborates with scholars based in New Zealand, Singapore and Russia. Alexander Melnikov's co-authors include Keng Meng Ng, I. Sh. Kalimullin, Rodney G. Downey, Nikolay Bazhenov, Rod Downey, Antonio Montalbán, Bakhadyr Khoussainov, André Nies, Noam Greenberg and Julia F. Knight and has published in prestigious journals such as Transactions of the American Mathematical Society, Advances in Mathematics and Theoretical Computer Science.

In The Last Decade

Alexander Melnikov

59 papers receiving 364 citations

Peers

Alexander Melnikov
I. Sh. Kalimullin Russia
Alberto Marcone Italy
Valentina Harizanov United States
Wojciech Samotij Israel
Keng Meng Ng Singapore
Russell Miller United States
Douglas Cenzer United States
Reed Solomon United States
Steffen Lempp United States
Yufei Zhao United States
I. Sh. Kalimullin Russia
Alexander Melnikov
Citations per year, relative to Alexander Melnikov Alexander Melnikov (= 1×) peers I. Sh. Kalimullin

Countries citing papers authored by Alexander Melnikov

Since Specialization
Citations

This map shows the geographic impact of Alexander Melnikov's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Alexander Melnikov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Melnikov more than expected).

Fields of papers citing papers by Alexander Melnikov

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Alexander Melnikov. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Alexander Melnikov. The network helps show where Alexander Melnikov may publish in the future.

Co-authorship network of co-authors of Alexander Melnikov

This figure shows the co-authorship network connecting the top 25 collaborators of Alexander Melnikov. A scholar is included among the top collaborators of Alexander Melnikov based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Alexander Melnikov. Alexander Melnikov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bazhenov, Nikolay, et al.. (2024). Computably and punctually universal spaces. Annals of Pure and Applied Logic. 176(1). 103491–103491.
2.
Bazhenov, Nikolay, Alexander Melnikov, & Keng Meng Ng. (2024). Every Δ⁰₂ Polish space is computable topological. Proceedings of the American Mathematical Society. 1 indexed citations
3.
Melnikov, Alexander, et al.. (2023). An arithmetic analysis of closed surfaces. Transactions of the American Mathematical Society. 377(3). 1543–1596. 2 indexed citations
4.
Melnikov, Alexander, et al.. (2023). COMPUTABLE TOPOLOGICAL GROUPS. Journal of Symbolic Logic. 90(1). 188–220. 2 indexed citations
5.
Downey, Rodney G. & Alexander Melnikov. (2023). COMPUTABLY COMPACT METRIC SPACES. Bulletin of Symbolic Logic. 29(2). 170–263. 10 indexed citations
6.
Melnikov, Alexander, et al.. (2023). Punctually presented structures I: Closure theorems. 12(4). 323–337.
7.
Melnikov, Alexander. (2023). A Course of Stochastic Analysis. 1 indexed citations
8.
Downey, Rodney G., et al.. (2021). Relativizing computable categoricity. Proceedings of the American Mathematical Society. 149(9). 3999–4013. 1 indexed citations
9.
Kalimullin, I. Sh. & Alexander Melnikov. (2021). Punctual Categoricity Relative to a Computable Oracle. Lobachevskii Journal of Mathematics. 42(4). 735–742. 1 indexed citations
10.
Melnikov, Alexander, et al.. (2020). COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM. Journal of Symbolic Logic. 85(4). 1664–1686. 13 indexed citations
11.
Melnikov, Alexander & Keng Meng Ng. (2020). A structure of punctual dimension two. Proceedings of the American Mathematical Society. 148(7). 3113–3128. 5 indexed citations
12.
Downey, Rod, Alexander Melnikov, & Keng Meng Ng. (2020). Enumerating abelian p-groups. Journal of Algebra. 560. 745–790. 2 indexed citations
13.
Bazhenov, Nikolay, et al.. (2019). AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES. Journal of Symbolic Logic. 84(4). 1630–1669. 17 indexed citations
14.
Downey, Rod, Alexander Melnikov, & Keng Meng Ng. (2019). Categorical linearly ordered structures. Annals of Pure and Applied Logic. 170(10). 1243–1255. 1 indexed citations
15.
Greenberg, Noam, et al.. (2018). UNIFORM PROCEDURES IN UNCOUNTABLE STRUCTURES. Journal of Symbolic Logic. 83(2). 529–550. 7 indexed citations
16.
Kalimullin, I. Sh., Alexander Melnikov, & Keng Meng Ng. (2017). Algebraic structures computable without delay. Theoretical Computer Science. 674. 73–98. 34 indexed citations
17.
Downey, Rod, Alexander Melnikov, & Keng Meng Ng. (2015). OnΔ20-categoricity of equivalence relations. Annals of Pure and Applied Logic. 166(9). 851–880. 7 indexed citations
18.
Downey, Rodney G. & Alexander Melnikov. (2014). Computable completely decomposable groups. Transactions of the American Mathematical Society. 366(8). 4243–4266. 14 indexed citations
19.
Melnikov, Alexander. (2013). Computably Isometric Spaces. Journal of Symbolic Logic. 78(4). 1055–1085. 22 indexed citations
20.
Downey, Rodney G. & Alexander Melnikov. (2012). Effectively categorical abelian groups. Journal of Algebra. 373. 223–248. 17 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by I. Sh. Kalimullin Breakdown of academic impact, for papers by Alberto Marcone Breakdown of academic impact, for papers by Valentina Harizanov Breakdown of academic impact, for papers by Wojciech Samotij Breakdown of academic impact, for papers by Keng Meng Ng Breakdown of academic impact, for papers by Russell Miller Breakdown of academic impact, for papers by Douglas Cenzer Breakdown of academic impact, for papers by Reed Solomon Breakdown of academic impact, for papers by Steffen Lempp Breakdown of academic impact, for papers by Yufei Zhao
Rankless by CCL
2026