Keng Meng Ng

Publication Activity (10 Years)

Years Active: 2006-2025
Publications (10 Years): 34

Top Topics

Equivalence Relation

Linearly Ordered

Algebraic Structures

Top Venues

Ann. Pure Appl. Log.

Theor. Comput. Sci.

Publications

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) (2025)
Alexander G. Melnikov, Keng Meng Ng
Separating notions in effective topology. Int. J. Algebra Comput. 33 (8) (2023)
Salah M. Elsayed, Keng Meng Ng
Computable soft separation axioms. Math. Struct. Comput. Sci. 33 (9) (2023)
Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities. J. Log. Comput. 33 (5) (2023)
Jun Le Goh, Steffen Lempp, Keng Meng Ng, Mariya Ivanova Soskova
Extensions of two constructions of Ahmad. Comput. 11 (3-4) (2022)
Barbara F. Csima, Keng Meng Ng
Every Δ20 degree is a strong degree of categoricity. J. Math. Log. 22 (3) (2022)
Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
Primitive recursive equivalence relations and their primitive recursive complexity. Comput. 11 (3-4) (2022)
Michael McInerney, Keng Meng Ng
-change genericity. Ann. Pure Appl. Log. 173 (7) (2022)
Keng Meng Ng, Frank Stephan, Yue Yang, Liang Yu
On Trees Without Hyperimmune Branches. CiE (2022)
Rod Downey, Alexander G. Melnikov, Keng Meng Ng
Foundations of Online Structure Theory II: The Operator Approach. Log. Methods Comput. Sci. 17 (3) (2021)
Keng Meng Ng, Nazanin Roshandel Tavana, Yue Yang
A recursion theoretic foundation of computation over real numbers. J. Log. Comput. 31 (7) (2021)
Vassilios Gregoriades, Takayuki Kihara, Keng Meng Ng
Turing degrees in Polish spaces and decomposability of Borel functions. J. Math. Log. 21 (1) (2021)
Keng Meng Ng, Hongyuan Yu
Effective Domination and the Bounded Jump. Notre Dame J. Formal Log. 61 (2) (2020)
Nikolay Bazhenov, Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
Online presentations of finitely generated structures. Theor. Comput. Sci. 844 (2020)
Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky
Punctual Categoricity and Universality. J. Symb. Log. 85 (4) (2020)
Andrey N. Frolov, Steffen Lempp, Keng Meng Ng, Guohua Wu
Computable linear Orders and Products. J. Symb. Log. 85 (2) (2020)
Keng Meng Ng, Nazanin Roshandel Tavana, Yue Yang
A recursion theoretic foundation of computation over real numbers. CoRR (2020)
Matthew Harrison-Trainor, Alexander G. Melnikov, Keng Meng Ng
Computability of Polish Spaces up to Homeomorphism. J. Symb. Log. 85 (4) (2020)
Noam Greenberg, Keng Meng Ng, Guohua Wu
Cupping and jump Classes in the computably Enumerable Degrees. J. Symb. Log. 85 (4) (2020)
Irakli O. Chitaia, Keng Meng Ng, Andrea Sorbi, Yue Yang
Incomparability in local structures of s-degrees and Q-degrees. Arch. Math. Log. 59 (7-8) (2020)
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) (2019)
Keng Meng Ng, Hongyuan Yu
On the Degree Structure of Equivalence Relations Under Computable Reducibility. Notre Dame J. Formal Log. 60 (4) (2019)
Rod Downey, Alexander G. Melnikov, Keng Meng Ng
Categorical linearly ordered structures. Ann. Pure Appl. Log. 170 (10) (2019)
Takayuki Kihara, Keng Meng Ng, Arno Pauly
Enumeration degrees and non-metrizable topology. CoRR (2019)
Rod Downey, Keng Meng Ng
Splitting into degrees with low computational strength. Ann. Pure Appl. Log. 169 (8) (2018)
Rod Downey, Michael McInerney, Keng Meng Ng
Lowness and logical depth. Theor. Comput. Sci. 702 (2017)
Weiguang Peng, NingNing Peng, Keng Meng Ng, Kazuyuki Tanaka, Yue Yang
Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees. Inf. Process. Lett. 125 (2017)
Keng Meng Ng
On Being Rod's Graduate Student. Computability and Complexity (2017)
Iskander Sh. Kalimullin, Alexander G. Melnikov, Keng Meng Ng
Algebraic structures computable without delay. Theor. Comput. Sci. 674 (2017)
Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
A Friedberg enumeration of equivalence structures. J. Math. Log. 17 (2) (2017)
Russell G. Miller, Keng Meng Ng
Finitary Reducibility on Equivalence Relations. J. Symb. Log. 81 (4) (2016)
Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
Abelian p-groups and the Halting problem. Ann. Pure Appl. Log. 167 (11) (2016)
Rod Downey, Alexander G. Melnikov, Keng Meng Ng
On -categoricity of equivalence relations. Ann. Pure Appl. Log. 166 (9) (2015)
Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies
Counting the changes of random Δ20 sets. J. Log. Comput. 25 (4) (2015)
Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
Iterated effective embeddings of abelian p-groups. Int. J. Algebra Comput. 24 (7) (2014)
Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Daniel D. Turetsky, Rebecca Weber
Lowness for effective Hausdorff dimension. J. Math. Log. 14 (2) (2014)
Uri Andrews, Steffen Lempp, Joseph S. Miller, Keng Meng Ng, Luca San Mauro, Andrea Sorbi
Universal computably Enumerable Equivalence Relations. J. Symb. Log. 79 (1) (2014)
Egor Ianovski, Russell G. Miller, Keng Meng Ng, André Nies
Complexity of Equivalence Relations and Preorders from Computability Theory. J. Symb. Log. 79 (3) (2014)
Johanna N. Y. Franklin, Keng Meng Ng
-Change Randomness and Weak Demuth Randomness. J. Symb. Log. 79 (3) (2014)
Keng Meng Ng, André Nies, Frank Stephan
The Complexity of Recursive Splittings of Random Sets. Comput. 3 (1) (2014)
Rod Downey, Keng Meng Ng
Lowness for bounded randomness. Theor. Comput. Sci. 460 (2012)
Paul Brodhead, Rod Downey, Keng Meng Ng
Bounded Randomness. Computation, Physics and Beyond (2012)
David Diamondstone, Keng Meng Ng
Strengthening prompt simplicity. J. Symb. Log. 76 (3) (2011)
Barbara F. Csima, Rod Downey, Keng Meng Ng
Limits on jump inversion for strong reducibilities. J. Symb. Log. 76 (4) (2011)
George Barmpalias, Rod Downey, Keng Meng Ng
Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. 76 (2) (2011)
Rod Downey, Keng Meng Ng
Effective Packing Dimension and Traceability. Notre Dame J. Formal Log. 51 (2) (2010)
Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller, Keng Meng Ng, André Nies
Sets. CiE (2010)
George Barmpalias, Andrew E. M. Lewis, Keng Meng Ng
classes in effective randomness. J. Symb. Log. 75 (1) (2010)
Rod Downey, Keng Meng Ng
Lowness for Demuth Randomness. CiE (2009)
Keng Meng Ng
On the Degrees of Diagonal Sets and the Failure of the Analogue of a Theorem of Martin. Notre Dame J. Formal Log. 50 (4) (2009)
Keng Meng Ng
On strongly jump traceable reals. Ann. Pure Appl. Log. 154 (1) (2008)
Keng Meng Ng
On very high degrees. J. Symb. Log. 73 (1) (2008)
Keng Meng Ng, Frank Stephan, Guohua Wu
Degrees of Weakly Computable Reals. CiE (2006)