Alexander G. Melnikov

51 papers B 1C 6Journal 41

Year	Rank	Type	Title / Venue / Authors
2026	—	`book`	Computable Structure Theory - In cooperation with the Association Computability in Europe Rodney G. Downey, Alexander G. Melnikov
2026	J	`jnl`	Computably locally compact groups and their closed subgroups. Int. J. Algebra Comput. Alexander G. Melnikov, André Nies
2025	J	`jnl`	A non-computable c.e. closed subset of [0,1]. J. Log. Comput. Serikzhan A. Badaev, Nikolay Bazhenov, Sergey Goncharov, Birzhan S. Kalmurzayev, Alexander G. Melnikov
2025	J	`jnl`	Computable Topological Groups. J. Symb. Log. Heer Tern Koh, Alexander G. Melnikov, Keng Meng Ng
2025	J	`jnl`	Computable classifications of continuous, transducer, and regular functions. Theor. Comput. Sci. Johanna N. Y. Franklin, Rupert Hölzl, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky
2025	J	`jnl`	Computably and punctually universal spaces. Ann. Pure Appl. Log. Ramil Bagaviev, Ilnur I. Batyrshin, Nikolay Bazhenov, Dmitry Bushtets, Marina Dorzhieva, Heer Tern Koh, Ruslan Kornev, Alexander G. Melnikov, Keng Meng Ng
2025	J	`jnl`	Punctually presented structures II: comparing presentations. Arch. Math. Log. Marina Dorzhieva, Rodney G. Downey, Ellen Hammatt, Alexander G. Melnikov, Keng Meng Ng
2024	J	`jnl`	Primitive recursive reverse mathematics. Ann. Pure Appl. Log. Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu, Alexander G. Melnikov
2023	J	`jnl`	Computable Stone spaces. Ann. Pure Appl. Log. Nikolay Bazhenov, Matthew Harrison-Trainor, Alexander G. Melnikov
2023	J	`jnl`	Computably Compact Metric Spaces. Bull. Symb. Log. Rodney G. Downey, Alexander G. Melnikov
2023	J	`jnl`	Punctually presented structures I: Closure theorems. Comput. Marina Dorzhieva, Alexander G. Melnikov
2023	J	`jnl`	Separating notions in effective topology. Int. J. Algebra Comput. Alexander G. Melnikov, Keng Meng Ng
2021	J	`jnl`	Foundations of Online Structure Theory II: The Operator Approach. Log. Methods Comput. Sci. Rod Downey, Alexander G. Melnikov, Keng Meng Ng
2021	J	`jnl`	Non-density in punctual computability. Ann. Pure Appl. Log. Noam Greenberg, Matthew Harrison-Trainor, Alexander G. Melnikov, Dan Turetsky
2021	J	`jnl`	Punctual definability on structures. Ann. Pure Appl. Log. Iskander Sh. Kalimullin, Alexander G. Melnikov, Antonio Montalbán
2020	J	`jnl`	Computability of Polish Spaces up to Homeomorphism. J. Symb. Log. Matthew Harrison-Trainor, Alexander G. Melnikov, Keng Meng Ng
2020	C	`conf`	Computable Analysis and Classification Problems. CiE Rodney G. Downey, Alexander G. Melnikov
2020	J	`jnl`	Decompositions of decidable abelian groups. Int. J. Algebra Comput. Nikolay Bazhenov, Sergey Goncharov, Alexander G. Melnikov
2020	J	`jnl`	Graphs are not universal for online computability. J. Comput. Syst. Sci. Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky
2020	J	`jnl`	On the Complexity of Classifying Lebesgue Spaces. J. Symb. Log. Tyler Brown, Timothy H. McNicholl, Alexander G. Melnikov
2020	J	`jnl`	Online presentations of finitely generated structures. Theor. Comput. Sci. Nikolay Bazhenov, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
2020	J	`jnl`	Punctual Categoricity and Universality. J. Symb. Log. Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky
2020	J	`jnl`	Turing reducibility in the fine hierarchy. Ann. Pure Appl. Log. Alexander G. Melnikov, Victor L. Selivanov, Mars M. Yamaleev
2019	J	`jnl`	Automatic and Polynomial-Time Algebraic Structures. J. Symb. Log. Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
2019	J	`jnl`	Categorical linearly ordered structures. Ann. Pure Appl. Log. Rod Downey, Alexander G. Melnikov, Keng Meng Ng
2019	J	`jnl`	Foundations of Online Structure Theory. Bull. Symb. Log. Nikolay Bazhenov, Rod Downey, Iskander Sh. Kalimullin, Alexander G. Melnikov
2019	B	`conf`	Random Subgroups of Rationals. MFCS Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan
2019	J	`jnl`	Random Subgroups of Rationals. CoRR Ziyuan Gao, Sanjay Jain, Bakhadyr Khoussainov, Wei Li, Alexander G. Melnikov, Karen Seidel, Frank Stephan
2018	J	`jnl`	Computable Polish Group Actions. J. Symb. Log. Alexander G. Melnikov, Antonio Montalbán
2018	J	`jnl`	Torsion-free abelian groups with optimal Scott families. J. Math. Log. Alexander G. Melnikov
2018	J	`jnl`	Uniform Procedures in uncountable Structures. J. Symb. Log. Noam Greenberg, Alexander G. Melnikov, Julia F. Knight, Daniel Turetsky
2017	J	`jnl`	A Friedberg enumeration of equivalence structures. J. Math. Log. Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
2017	J	`jnl`	Algebraic structures computable without delay. Theor. Comput. Sci. Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
2017	—	`ed.`	Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday Computability and Complexity Adam R. Day, Michael R. Fellows, Noam Greenberg, Bakhadyr Khoussainov, Alexander G. Melnikov, Frances A. Rosamond
2017	J	`jnl`	Computable Functors and Effective interpretability. J. Symb. Log. Matthew Harrison-Trainor, Alexander G. Melnikov, Russell G. Miller, Antonio Montalbán
2017	C	`conf`	Eliminating Unbounded Search in Computable Algebra. CiE Alexander G. Melnikov
2017	J	`jnl`	New Degree Spectra of Abelian Groups. Notre Dame J. Formal Log. Alexander G. Melnikov
2016	J	`jnl`	Abelian p-groups and the Halting problem. Ann. Pure Appl. Log. Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
2015	J	`jnl`	On -categoricity of equivalence relations. Ann. Pure Appl. Log. Rod Downey, Alexander G. Melnikov, Keng Meng Ng
2014	J	`jnl`	Computable Abelian Groups. Bull. Symb. Log. Alexander G. Melnikov
2014	—	`ch.`	Computable model theory. Turing's Legacy Ekaterina B. Fokina, Valentina S. Harizanov, Alexander G. Melnikov
2014	J	`jnl`	Iterated effective embeddings of abelian p-groups. Int. J. Algebra Comput. Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
2013	J	`jnl`	Computably isometric spaces. J. Symb. Log. Alexander G. Melnikov
2013	C	`conf`	The Classification Problem for Compact Computable Metric Spaces. CiE Alexander G. Melnikov, André Nies
2012	J	`jnl`	Jump degrees of torsion-free abelian groups. J. Symb. Log. Brooke M. Andersen, Asher M. Kach, Alexander G. Melnikov, Reed Solomon
2011	J	`jnl`	Classes of Ulm type and coding rank-homogeneous trees in other structures. J. Symb. Log. Ekaterina B. Fokina, Julia F. Knight, Alexander G. Melnikov, Sara Quinn, C. Safranski
2010	C	`conf`	Computable Ordered Abelian Groups and Fields. CiE Alexander G. Melnikov
2010	J	`jnl`	Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame J. Formal Log. Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky
2009	C	`conf`	0 CiE Alexander G. Melnikov
2009	J	`jnl`	Enumerations and Completely Decomposable Torsion-Free Abelian Groups. Theory Comput. Syst. Alexander G. Melnikov
2007	C	`conf`	Enumerations and Torsion Free Abelian Groups. CiE Alexander G. Melnikov