default search action
Keng Meng Ng
Person information
- affiliation: Nanyang Technological University, Singapore
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j45]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) - 2023
- [j44]Alexander G. Melnikov
Separating notions in effective topology. Int. J. Algebra Comput. 33(8): 1687-1711 (2023) - [j43]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): 1060-1088 (2023) - [j42]Salah M. Elsayed
Computable soft separation axioms. Math. Struct. Comput. Sci. 33(9): 781-808 (2023) - 2022
- [j41]Michael McInerney, Keng Meng Ng:
Separating weak α-change and α-change genericity. Ann. Pure Appl. Log. 173(7): 103134 (2022) - [j40]Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro
Primitive recursive equivalence relations and their primitive recursive complexity. Comput. 11(3-4): 187-221 (2022) - [j39]Jun Le Goh
Extensions of two constructions of Ahmad. Comput. 11(3-4): 269-297 (2022) - [j38]Barbara F. Csima, Keng Meng Ng:
Every Δ20 degree is a strong degree of categoricity. J. Math. Log. 22(3): 2250022:1-2250022:18 (2022) - [c6]Keng Meng Ng, Frank Stephan
On Trees Without Hyperimmune Branches. CiE 2022: 234-245 - 2021
- [j37]Vassilios Gregoriades, Takayuki Kihara
Turing degrees in Polish spaces and decomposability of Borel functions. J. Math. Log. 21(1): 2050021:1-2050021:41 (2021) - [j36]Rod Downey, Alexander G. Melnikov
Foundations of Online Structure Theory II: The Operator Approach. Log. Methods Comput. Sci. 17(3) (2021) - [j35]Keng Meng Ng, Nazanin Roshandel Tavana, Yue Yang:
A recursion theoretic foundation of computation over real numbers. J. Log. Comput. 31(7): 1660-1689 (2021) - 2020
- [j34]Irakli O. Chitaia, Keng Meng Ng
Incomparability in local structures of s-degrees and Q-degrees. Arch. Math. Log. 59(7-8): 777-791 (2020) - [j33]Andrey N. Frolov, Steffen Lempp, Keng Meng Ng, Guohua Wu:
Computable linear Orders and Products. J. Symb. Log. 85(2): 605-623 (2020) - [j32]Rod Downey, Noam Greenberg, Alexander G. Melnikov
Punctual Categoricity and Universality. J. Symb. Log. 85(4): 1427-1466 (2020) - [j31]Noam Greenberg, Keng Meng Ng, Guohua Wu:
Cupping and jump Classes in the computably Enumerable Degrees. J. Symb. Log. 85(4): 1499-1545 (2020) - [j30]Matthew Harrison-Trainor, Alexander G. Melnikov
Computability of Polish Spaces up to Homeomorphism. J. Symb. Log. 85(4): 1664-1686 (2020) - [j29]Keng Meng Ng, Hongyuan Yu:
Effective Domination and the Bounded Jump. Notre Dame J. Formal Log. 61(2): 203-225 (2020) - [j28]Nikolay Bazhenov, Iskander Sh. Kalimullin
Online presentations of finitely generated structures. Theor. Comput. Sci. 844: 195-216 (2020) - [i2]Keng Meng Ng, Nazanin Roshandel Tavana, Yue Yang:
A recursion theoretic foundation of computation over real numbers. CoRR abs/2010.00791 (2020)
2010 – 2019
- 2019
- [j27]Rod Downey, Alexander G. Melnikov
Categorical linearly ordered structures. Ann. Pure Appl. Log. 170(10): 1243-1255 (2019) - [j26]Nikolay Bazhenov, Matthew Harrison-Trainor, Iskander Sh. Kalimullin
Automatic and Polynomial-Time Algebraic Structures. J. Symb. Log. 84(4): 1630-1669 (2019) - [j25]Keng Meng Ng
On the Degree Structure of Equivalence Relations Under Computable Reducibility. Notre Dame J. Formal Log. 60(4): 733-761 (2019) - [i1]Takayuki Kihara, Keng Meng Ng, Arno Pauly:
Enumeration degrees and non-metrizable topology. CoRR abs/1904.04107 (2019) - 2018
- [j24]Rod Downey, Keng Meng Ng
Splitting into degrees with low computational strength. Ann. Pure Appl. Log. 169(8): 803-834 (2018) - 2017
- [j23]Weiguang Peng
Optimal depth-first algorithms and equilibria of independent distributions on multi-branching trees. Inf. Process. Lett. 125: 41-45 (2017) - [j22]Rodney G. Downey, Alexander G. Melnikov
A Friedberg enumeration of equivalence structures. J. Math. Log. 17(2): 1750008:1-1750008:28 (2017) - [j21]Iskander Sh. Kalimullin
Algebraic structures computable without delay. Theor. Comput. Sci. 674: 73-98 (2017) - [j20]Rod Downey, Michael McInerney, Keng Meng Ng
Lowness and logical depth. Theor. Comput. Sci. 702: 23-33 (2017) - [c5]Keng Meng Ng:
On Being Rod's Graduate Student. Computability and Complexity 2017: 122-123 - 2016
- [j19]Rodney G. Downey, Alexander G. Melnikov
Abelian p-groups and the Halting problem. Ann. Pure Appl. Log. 167(11): 1123-1138 (2016) - [j18]Russell G. Miller, Keng Meng Ng
Finitary Reducibility on Equivalence Relations. J. Symb. Log. 81(4): 1225-1254 (2016) - 2015
- [j17]Rod Downey, Alexander G. Melnikov
On -categoricity of equivalence relations. Ann. Pure Appl. Log. 166(9): 851-880 (2015) - [j16]Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller
Counting the changes of random Δ20 sets. J. Log. Comput. 25(4): 1073-1089 (2015) - 2014
- [j15]Keng Meng Ng
The Complexity of Recursive Splittings of Random Sets. Comput. 3(1): 1-8 (2014) - [j14]Rodney G. Downey, Alexander G. Melnikov
Iterated effective embeddings of abelian p-groups. Int. J. Algebra Comput. 24(7): 1055- (2014) - [j13]Steffen Lempp, Joseph S. Miller
Lowness for effective Hausdorff dimension. J. Math. Log. 14(2): 1450011 (2014) - [j12]Uri Andrews, Steffen Lempp, Joseph S. Miller
Universal computably Enumerable Equivalence Relations. J. Symb. Log. 79(1): 60-88 (2014) - [j11]Johanna N. Y. Franklin, Keng Meng Ng:
ω-Change Randomness and Weak Demuth Randomness. J. Symb. Log. 79(3): 776-791 (2014) - [j10]Egor Ianovski
Complexity of Equivalence Relations and Preorders from Computability Theory. J. Symb. Log. 79(3): 859-881 (2014) - 2012
- [j9]Rod Downey, Keng Meng Ng
Lowness for bounded randomness. Theor. Comput. Sci. 460: 1-9 (2012) - [c4]Paul Brodhead, Rod Downey, Keng Meng Ng
Bounded Randomness. Computation, Physics and Beyond 2012: 59-70 - 2011
- [j8]George Barmpalias
Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. 76(2): 491-518 (2011) - [j7]David Diamondstone, Keng Meng Ng
Strengthening prompt simplicity. J. Symb. Log. 76(3): 946-972 (2011) - [j6]Barbara F. Csima, Rod Downey, Keng Meng Ng
Limits on jump inversion for strong reducibilities. J. Symb. Log. 76(4): 1287-1296 (2011) - 2010
- [j5]George Barmpalias
The importance of Pi01 classes in effective randomness. J. Symb. Log. 75(1): 387-400 (2010) - [j4]Rod Downey, Keng Meng Ng
Effective Packing Dimension and Traceability. Notre Dame J. Formal Log. 51(2): 279-290 (2010) - [c3]Santiago Figueira, Denis R. Hirschfeldt, Joseph S. Miller
Counting the Changes of Random D02 Sets. CiE 2010: 162-171
2000 – 2009
- 2009
- [j3]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): 469-493 (2009) - [c2]Rod Downey, Keng Meng Ng
Lowness for Demuth Randomness. CiE 2009: 154-166 - 2008
- [j2]Keng Meng Ng
On strongly jump traceable reals. Ann. Pure Appl. Log. 154(1): 51-69 (2008) - [j1]Keng Meng Ng
On very high degrees. J. Symb. Log. 73(1): 309-342 (2008) - 2006
- [c1]Keng Meng Ng
Degrees of Weakly Computable Reals. CiE 2006: 413-422
Coauthor Index
aka: Rod Downey
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:10 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: