default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander G. Melnikov
Person information
- affiliation: Massey University, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j35]Ramil Bagaviev, Ilnur I. Batyrshin
, Nikolay Bazhenov, Dmitry Bushtets, Marina Dorzhieva, Heer Tern Koh, Ruslan Kornev, Alexander G. Melnikov, Keng Meng Ng:
Computably and punctually universal spaces. Ann. Pure Appl. Log. 176(1): 103491 (2025)- 2024
- [j34]Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu, Alexander G. Melnikov:
Primitive recursive reverse mathematics. Ann. Pure Appl. Log. 175(Issue 1, Part A): 103354 (2024) - 2023
- [j33]Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander G. Melnikov:
Computable Stone spaces. Ann. Pure Appl. Log. 174(9): 103304 (2023) - [j32]Rodney G. Downey, Alexander G. Melnikov:
Computably Compact Metric Spaces. Bull. Symb. Log. 29(2): 170-263 (2023) - [j31]Marina Dorzhieva, Alexander G. Melnikov:
Punctually presented structures I: Closure theorems. Comput. 12(4): 323-337 (2023) - [j30]Alexander G. Melnikov, Keng Meng Ng:
Separating notions in effective topology. Int. J. Algebra Comput. 33(8): 1687-1711 (2023) - 2021
- [j29]Iskander Sh. Kalimullin, Alexander G. Melnikov, Antonio Montalbán:
Punctual definability on structures. Ann. Pure Appl. Log. 172(8): 102987 (2021) - [j28]Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov, Dan Turetsky:
Non-density in punctual computability. Ann. Pure Appl. Log. 172(9): 102985 (2021) - [j27]Rod Downey, Alexander G. Melnikov, Keng Meng Ng:
Foundations of Online Structure Theory II: The Operator Approach. Log. Methods Comput. Sci. 17(3) (2021) - 2020
- [j26]Alexander G. Melnikov, Victor L. Selivanov, Mars M. Yamaleev:
Turing reducibility in the fine hierarchy. Ann. Pure Appl. Log. 171(7): 102766 (2020) - [j25]Nikolay Bazhenov, Sergey Goncharov, Alexander G. Melnikov:
Decompositions of decidable abelian groups. Int. J. Algebra Comput. 30(1): 49-90 (2020) - [j24]Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky:
Graphs are not universal for online computability. J. Comput. Syst. Sci. 112: 1-12 (2020) - [j23]Tyler Brown, Timothy H. McNicholl, Alexander G. Melnikov:
On the Complexity of Classifying Lebesgue Spaces. J. Symb. Log. 85(3): 1254-1288 (2020) - [j22]Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky:
Punctual Categoricity and Universality. J. Symb. Log. 85(4): 1427-1466 (2020) - [j21]Matthew Harrison-Trainor, Alexander G. Melnikov, Keng Meng Ng:
Computability of Polish Spaces up to Homeomorphism. J. Symb. Log. 85(4): 1664-1686 (2020) - [j20]Nikolay Bazhenov, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng:
Online presentations of finitely generated structures. Theor. Comput. Sci. 844: 195-216 (2020) - 2019
- [j19]Rod Downey, Alexander G. Melnikov, Keng Meng Ng:
Categorical linearly ordered structures. Ann. Pure Appl. Log. 170(10): 1243-1255 (2019) - [j18]Nikolay Bazhenov, Rod Downey, Iskander Sh. Kalimullin, Alexander G. Melnikov:
Foundations of Online Structure Theory. Bull. Symb. Log. 25(2): 141-181 (2019) - [j17]Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng:
Automatic and Polynomial-Time Algebraic Structures. J. Symb. Log. 84(4): 1630-1669 (2019) - 2018
- [j16]Alexander G. Melnikov:
Torsion-free abelian groups with optimal Scott families. J. Math. Log. 18(1): 1850002:1-1850002:47 (2018) - [j15]Alexander G. Melnikov, Antonio Montalbán:
Computable Polish Group Actions. J. Symb. Log. 83(2): 443-460 (2018) - [j14]Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky:
Uniform Procedures in uncountable Structures. J. Symb. Log. 83(2): 529-550 (2018) - 2017
- [j13]Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng:
A Friedberg enumeration of equivalence structures. J. Math. Log. 17(2): 1750008:1-1750008:28 (2017) - [j12]Matthew Harrison-Trainor, Alexander G. Melnikov, Russell G. Miller, Antonio Montalbán:
Computable Functors and Effective interpretability. J. Symb. Log. 82(1): 77-97 (2017) - [j11]Alexander G. Melnikov:
New Degree Spectra of Abelian Groups. Notre Dame J. Formal Log. 58(4): 507-525 (2017) - [j10]Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng:
Algebraic structures computable without delay. Theor. Comput. Sci. 674: 73-98 (2017) - 2016
- [j9]Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng:
Abelian p-groups and the Halting problem. Ann. Pure Appl. Log. 167(11): 1123-1138 (2016) - 2015
- [j8]Rod Downey, Alexander G. Melnikov, Keng Meng Ng:
On -categoricity of equivalence relations. Ann. Pure Appl. Log. 166(9): 851-880 (2015) - 2014
- [j7]Alexander G. Melnikov:
Computable Abelian Groups. Bull. Symb. Log. 20(3): 315-356 (2014) - [j6]Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng:
Iterated effective embeddings of abelian p-groups. Int. J. Algebra Comput. 24(7): 1055- (2014) - 2013
- [j5]Alexander G. Melnikov:
Computably isometric spaces. J. Symb. Log. 78(4): 1055-1085 (2013) - 2012
- [j4]Brooke M. Andersen, Asher M. Kach, Alexander G. Melnikov, Reed Solomon:
Jump degrees of torsion-free abelian groups. J. Symb. Log. 77(4): 1067-1100 (2012) - 2011
- [j3]Ekaterina B. Fokina, Julia F. Knight, Alexander G. Melnikov, Sara Quinn, C. Safranski:
Classes of Ulm type and coding rank-homogeneous trees in other structures. J. Symb. Log. 76(3): 846-869 (2011) - 2010
- [j2]Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky:
Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame J. Formal Log. 51(1): 85-96 (2010) - 2009
- [j1]Alexander G. Melnikov:
Enumerations and Completely Decomposable Torsion-Free Abelian Groups. Theory Comput. Syst. 45(4): 897-916 (2009)
Conference and Workshop Papers
- 2020
- [c7]Rodney G. Downey, Alexander G. Melnikov:
Computable Analysis and Classification Problems. CiE 2020: 100-111 - 2019
- [c6]Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan:
Random Subgroups of Rationals. MFCS 2019: 25:1-25:14 - 2017
- [c5]Alexander G. Melnikov:
Eliminating Unbounded Search in Computable Algebra. CiE 2017: 77-87 - 2013
- [c4]Alexander G. Melnikov, André Nies:
The Classification Problem for Compact Computable Metric Spaces. CiE 2013: 320-328 - 2010
- [c3]Alexander G. Melnikov:
Computable Ordered Abelian Groups and Fields. CiE 2010: 321-330 - 2009
- [c2]Alexander G. Melnikov:
0"-Categorical Completely Decomposable Torsion-Free Abelian Groups. CiE 2009: 362-371 - 2007
- [c1]Alexander G. Melnikov:
Enumerations and Torsion Free Abelian Groups. CiE 2007: 566-574
Parts in Books or Collections
- 2014
- [p1]Ekaterina B. Fokina, Valentina S. Harizanov, Alexander G. Melnikov:
Computable model theory. Turing's Legacy 2014: 124-194
Editorship
- 2017
- [e1]Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond:
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 10010, Springer 2017, ISBN 978-3-319-50061-4 [contents]
Informal and Other Publications
- 2019
- [i1]Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan:
Random Subgroups of Rationals. CoRR abs/1901.04743 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
