Degrees of Weakly Computable Reals. - Keng Meng Ng; Frank Stephan 001; Guohua Wu (CiE, 2006)

On strongly jump traceable reals. - Keng Meng Ng (Ann. Pure Appl. Log., 2008)

On very high degrees. - Keng Meng Ng (J. Symb. Log., 2008)

Lowness for Demuth Randomness. - Rod Downey; Keng Meng Ng (CiE, 2009)

On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin. - Keng Meng Ng (Notre Dame J. Formal Log., 2009)

Counting the Changes of Random D02 Sets. - Santiago Figueira; Denis R. Hirschfeldt; Joseph S. Miller; Keng Meng Ng; André Nies (CiE, 2010)

The importance of Pi01 classes in effective randomness. - George Barmpalias; Andrew E. M. Lewis; Keng Meng Ng (J. Symb. Log., 2010)

Effective Packing Dimension and Traceability. - Rod Downey; Keng Meng Ng (Notre Dame J. Formal Log., 2010)

Jump inversions inside effectively closed sets and applications to randomness. - George Barmpalias; Rod Downey; Keng Meng Ng (J. Symb. Log., 2011)

Limits on jump inversion for strong reducibilities. - Barbara F. Csima; Rod Downey; Keng Meng Ng (J. Symb. Log., 2011)

Strengthening prompt simplicity. - David Diamondstone; Keng Meng Ng (J. Symb. Log., 2011)

Bounded Randomness. - Paul Brodhead; Rod Downey; Keng Meng Ng (Computation, Physics and Beyond, 2012)

Lowness for bounded randomness. - Rod Downey; Keng Meng Ng (Theor. Comput. Sci., 2012)

The Complexity of Recursive Splittings of Random Sets. - Keng Meng Ng; André Nies; Frank Stephan 001 (Comput., 2014)

Iterated effective embeddings of abelian p-groups. - Rodney G. Downey; Alexander G. Melnikov; Keng Meng Ng (Int. J. Algebra Comput., 2014)

Lowness for effective Hausdorff dimension. - Steffen Lempp; Joseph S. Miller; Keng Meng Ng; Daniel D. Turetsky; Rebecca Weber (J. Math. Log., 2014)

Universal computably Enumerable Equivalence Relations. - Uri Andrews; Steffen Lempp; Joseph S. Miller; Keng Meng Ng; Luca San Mauro; Andrea Sorbi (J. Symb. Log., 2014)

ω-Change Randomness and Weak Demuth Randomness. - Johanna N. Y. Franklin; Keng Meng Ng (J. Symb. Log., 2014)

Complexity of Equivalence Relations and Preorders from Computability Theory. - Egor Ianovski; Russell G. Miller; Keng Meng Ng; André Nies (J. Symb. Log., 2014)

On -categoricity of equivalence relations. - Rod Downey; Alexander G. Melnikov; Keng Meng Ng (Ann. Pure Appl. Log., 2015)

Counting the changes of random Δ20 sets. - Santiago Figueira; Denis R. Hirschfeldt; Joseph S. Miller; Keng Meng Ng; André Nies (J. Log. Comput., 2015)

Abelian p-groups and the Halting problem. - Rodney G. Downey; Alexander G. Melnikov; Keng Meng Ng (Ann. Pure Appl. Log., 2016)

Finitary Reducibility on Equivalence Relations. - Russell G. Miller; Keng Meng Ng (J. Symb. Log., 2016)

On Being Rod's Graduate Student. - Keng Meng Ng (Computability and Complexity, 2017)

Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees. - Weiguang Peng; NingNing Peng; Keng Meng Ng; Kazuyuki Tanaka; Yue Yang 004 (Inf. Process. Lett., 2017)

A Friedberg enumeration of equivalence structures. - Rodney G. Downey; Alexander G. Melnikov; Keng Meng Ng (J. Math. Log., 2017)

Lowness and logical depth. - Rod Downey; Michael McInerney; Keng Meng Ng (Theor. Comput. Sci., 2017)

Algebraic structures computable without delay. - Iskander Sh. Kalimullin; Alexander G. Melnikov; Keng Meng Ng (Theor. Comput. Sci., 2017)

Splitting into degrees with low computational strength. - Rod Downey; Keng Meng Ng (Ann. Pure Appl. Log., 2018)

Categorical linearly ordered structures. - Rod Downey; Alexander G. Melnikov; Keng Meng Ng (Ann. Pure Appl. Log., 2019)

Enumeration degrees and non-metrizable topology. - Takayuki Kihara; Keng Meng Ng; Arno Pauly (CoRR, 2019)

Automatic and Polynomial-Time Algebraic Structures. - Nikolay Bazhenov 001; Matthew Harrison-Trainor; Iskander Sh. Kalimullin; Alexander G. Melnikov; Keng Meng Ng (J. Symb. Log., 2019)

On the Degree Structure of Equivalence Relations Under Computable Reducibility. - Keng Meng Ng; Hongyuan Yu (Notre Dame J. Formal Log., 2019)

Incomparability in local structures of s-degrees and Q-degrees. - Irakli O. Chitaia; Keng Meng Ng; Andrea Sorbi; Yue Yang 004 (Arch. Math. Log., 2020)

Punctual Categoricity and Universality. - Rod Downey; Noam Greenberg; Alexander G. Melnikov; Keng Meng Ng; Daniel Turetsky (J. Symb. Log., 2020)

Computable linear Orders and Products. - Andrey N. Frolov; Steffen Lempp; Keng Meng Ng; Guohua Wu (J. Symb. Log., 2020)

Cupping and jump Classes in the computably Enumerable Degrees. - Noam Greenberg; Keng Meng Ng; Guohua Wu (J. Symb. Log., 2020)

Computability of Polish Spaces up to Homeomorphism. - Matthew Harrison-Trainor; Alexander G. Melnikov; Keng Meng Ng (J. Symb. Log., 2020)

Effective Domination and the Bounded Jump. - Keng Meng Ng; Hongyuan Yu (Notre Dame J. Formal Log., 2020)

Online presentations of finitely generated structures. - Nikolay Bazhenov 001; Iskander Sh. Kalimullin; Alexander G. Melnikov; Keng Meng Ng (Theor. Comput. Sci., 2020)

Turing degrees in Polish spaces and decomposability of Borel functions. - Vassilios Gregoriades; Takayuki Kihara; Keng Meng Ng (J. Math. Log., 2021)

Foundations of Online Structure Theory II: The Operator Approach. - Rod Downey; Alexander G. Melnikov; Keng Meng Ng (Log. Methods Comput. Sci., 2021)

A recursion theoretic foundation of computation over real numbers. - Keng Meng Ng; Nazanin Roshandel Tavana; Yue Yang 004 (J. Log. Comput., 2021)

On Trees Without Hyperimmune Branches. - Keng Meng Ng; Frank Stephan 001; Yue Yang 004; Liang Yu (CiE, 2022)

Separating weak α-change and α-change genericity. - Michael McInerney; Keng Meng Ng (Ann. Pure Appl. Log., 2022)

Primitive recursive equivalence relations and their primitive recursive complexity. - Nikolay Bazhenov 001; Keng Meng Ng; Luca San Mauro; Andrea Sorbi (Comput., 2022)

Extensions of two constructions of Ahmad. - Jun Le Goh; Steffen Lempp; Keng Meng Ng; Mariya Ivanova Soskova (Comput., 2022)

Every Δ20 degree is a strong degree of categoricity. - Barbara F. Csima; Keng Meng Ng (J. Math. Log., 2022)

Computable soft separation axioms. - Salah M. Elsayed; Keng Meng Ng (Math. Struct. Comput. Sci., 2023)

Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities. - Irakli O. Chitaia; Keng Meng Ng; Andrea Sorbi; Yue Yang 004 (J. Log. Comput., 2023)

Separating notions in effective topology. - Alexander G. Melnikov; Keng Meng Ng (Int. J. Algebra Comput., 2023)

Computably and punctually universal spaces. - Ramil Bagaviev; Ilnur I. Batyrshin; Nikolay Bazhenov 001; Dmitry Bushtets; Marina Dorzhieva; Heer Tern Koh; Ruslan Kornev; Alexander G. Melnikov; Keng Meng Ng (Ann. Pure Appl. Log., 2025)