| Universal computably enumerable equivalence relations U Andrews, S Lempp, JS Miller, KM Ng, L San Mauro, A Sorbi The Journal of Symbolic Logic 79 (1), 60-88, 2014 | 76 | 2014 |
| Difference randomness J Franklin, KM Ng Proceedings of the American Mathematical Society 139 (1), 345-360, 2011 | 65 | 2011 |
| Algebraic structures computable without delay I Kalimullin, A Melnikov, KM Ng Theoretical Computer Science 674, 73-98, 2017 | 57 | 2017 |
| Martin-Löf random points satisfy Birkhoff’s ergodic theorem for effectively closed sets J Franklin, N Greenberg, J Miller, KM Ng Proceedings of the American Mathematical Society 140 (10), 3623-3628, 2012 | 49 | 2012 |
| Computable structures and operations on the space of continuous functions AG Melnikov, KM Ng Fund. Math 233 (2), 101-141, 2016 | 33 | 2016 |
| Counting the changes of random∆ 0 2 sets S Figueira, D Hirschfeldt, JS Miller, KM Ng, A Nies | 31* | 2010 |
| An analogy between cardinal characteristics and highness properties of oracles J Brendle, A Brooke-Taylor, KM Ng, A Nies Proceedings of the 13th Asian Logic Conference, 1-28, 2015 | 30 | 2015 |
| Complexity of equivalence relations and preorders from computability theory E Ianovski, R Miller, KM Ng, A Nies The Journal of Symbolic Logic 79 (3), 859-881, 2014 | 30 | 2014 |
| Automatic and polynomial-time algebraic structures N Bazhenov, M Harrison-Trainor, I Kalimullin, A Melnikov, KM Ng The Journal of Symbolic Logic 84 (4), 1630-1669, 2019 | 29 | 2019 |
| The importance of Π10 classes in effective randomness G Barmpalias, AEM Lewis, KM Ng The Journal of Symbolic Logic 75 (1), 387-400, 2010 | 25 | 2010 |
| Foundations of online structure theory II: The operator approach R Downey, A Melnikov, KM Ng Logical Methods in Computer Science 17, 2021 | 20 | 2021 |
| Computability of Polish spaces up to homeomorphism M Harrison-Trainor, A Melnikov, KM Ng The Journal of Symbolic Logic 85 (4), 1664-1686, 2020 | 20 | 2020 |
| On strongly jump traceable reals KM Ng Annals of Pure and Applied Logic 154 (1), 51-69, 2008 | 20 | 2008 |
| The diversity of categoricity without delay IS Kalimullin, AG Melnikov, KM Ng Algebra and Logic 56 (2), 171-177, 2017 | 19 | 2017 |
| Bounded randomness P Brodhead, R Downey, KM Ng International Conference on Teaching and Computational Science, 59-70, 2012 | 16 | 2012 |
| The back-and-forth method and computability without delay AG Melnikov, KM Ng Israel Journal of Mathematics 234, 959-1000, 2019 | 15 | 2019 |
| On the degree structure of equivalence relations under computable reducibility KM Ng, H Yu | 14 | 2019 |
| Enumeration degrees and non-metrizable topology T Kihara, KM Ng, A Pauly arXiv preprint arXiv:1904.04107, 2019 | 14 | 2019 |
| Computable torsion abelian groups AG Melnikov, KM Ng Advances in Mathematics 325, 864-907, 2018 | 13 | 2018 |
| Abelian p-groups and the halting problem R Downey, AG Melnikov, KM Ng Annals of Pure and Applied Logic 167 (11), 1123-1138, 2016 | 13 | 2016 |
Alexander MelnikovAssociate Professor at Victoria University of Wellington, New ZealandGeverifieerd e-mailadres voor vuw.ac.nz
