Keng Meng Ng

619 total citations
53 papers, 291 citations indexed

About

Keng Meng Ng is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Keng Meng Ng has authored 53 papers receiving a total of 291 indexed citations (citations by other indexed papers that have themselves been cited), including 50 papers in Computational Theory and Mathematics, 25 papers in Geometry and Topology and 12 papers in Artificial Intelligence. Recurrent topics in Keng Meng Ng's work include Computability, Logic, AI Algorithms (49 papers), semigroups and automata theory (39 papers) and Advanced Topology and Set Theory (25 papers). Keng Meng Ng is often cited by papers focused on Computability, Logic, AI Algorithms (49 papers), semigroups and automata theory (39 papers) and Advanced Topology and Set Theory (25 papers). Keng Meng Ng collaborates with scholars based in Singapore, New Zealand and United States. Keng Meng Ng's co-authors include Alexander Melnikov, I. Sh. Kalimullin, Rod Downey, Joseph S. Miller, Nikolay Bazhenov, George Barmpalias, Steffen Lempp, Andrea Sorbi, Rodney G. Downey and Noam Greenberg and has published in prestigious journals such as Transactions of the American Mathematical Society, Advances in Mathematics and Theoretical Computer Science.

In The Last Decade

Keng Meng Ng

42 papers receiving 265 citations

Peers

Keng Meng Ng
Douglas Cenzer United States
Andreas Weiermann Belgium
Valentina Harizanov United States
I. Sh. Kalimullin Russia
Russell Miller United States
Alberto Marcone Italy
Piergiorgio Odifreddi Italy
Maksim Zhukovskii Russia
Sebastiaan A. Terwijn Netherlands
Alexander Melnikov New Zealand
Douglas Cenzer United States
Keng Meng Ng
Citations per year, relative to Keng Meng Ng Keng Meng Ng (= 1×) peers Douglas Cenzer

Countries citing papers authored by Keng Meng Ng

Since Specialization
Citations

This map shows the geographic impact of Keng Meng Ng's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Keng Meng Ng with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Keng Meng Ng more than expected).

Fields of papers citing papers by Keng Meng Ng

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Keng Meng Ng. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Keng Meng Ng. The network helps show where Keng Meng Ng may publish in the future.

Co-authorship network of co-authors of Keng Meng Ng

This figure shows the co-authorship network connecting the top 25 collaborators of Keng Meng Ng. A scholar is included among the top collaborators of Keng Meng Ng based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Keng Meng Ng. Keng Meng Ng is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Melnikov, Alexander, et al.. (2025). COUNTEREXAMPLES IN EFFECTIVE TOPOLOGY. Journal of Symbolic Logic. 1–24.
2.
Bazhenov, Nikolay, et al.. (2024). Computably and punctually universal spaces. Annals of Pure and Applied Logic. 176(1). 103491–103491.
3.
Bazhenov, Nikolay, Alexander Melnikov, & Keng Meng Ng. (2024). Every Δ⁰₂ Polish space is computable topological. Proceedings of the American Mathematical Society. 1 indexed citations
4.
Greenberg, Noam, Sanjay Jain, Keng Meng Ng, et al.. (2023). Aspects of Computation and Automata Theory with Applications. 2 indexed citations
5.
Melnikov, Alexander, et al.. (2020). COMPUTABILITY OF POLISH SPACES UP TO HOMEOMORPHISM. Journal of Symbolic Logic. 85(4). 1664–1686. 13 indexed citations
6.
Melnikov, Alexander & Keng Meng Ng. (2020). A structure of punctual dimension two. Proceedings of the American Mathematical Society. 148(7). 3113–3128. 5 indexed citations
7.
Downey, Rod, Alexander Melnikov, & Keng Meng Ng. (2020). Enumerating abelian p-groups. Journal of Algebra. 560. 745–790. 2 indexed citations
8.
Bazhenov, Nikolay, et al.. (2019). AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES. Journal of Symbolic Logic. 84(4). 1630–1669. 17 indexed citations
9.
Downey, Rod, Alexander Melnikov, & Keng Meng Ng. (2019). Categorical linearly ordered structures. Annals of Pure and Applied Logic. 170(10). 1243–1255. 1 indexed citations
10.
Ng, Keng Meng, et al.. (2019). On Kierstead’s conjecture. Transactions of the American Mathematical Society. 372(5). 3713–3753. 1 indexed citations
11.
Downey, Rod & Keng Meng Ng. (2018). Splitting into degrees with low computational strength. Annals of Pure and Applied Logic. 169(8). 803–834.
12.
Kalimullin, I. Sh., Alexander Melnikov, & Keng Meng Ng. (2017). Algebraic structures computable without delay. Theoretical Computer Science. 674. 73–98. 34 indexed citations
13.
Downey, Rod, et al.. (2017). Lowness and logical depth. Theoretical Computer Science. 702. 23–33. 4 indexed citations
14.
Melnikov, Alexander & Keng Meng Ng. (2017). Computable torsion abelian groups. Advances in Mathematics. 325. 864–907. 6 indexed citations
15.
Downey, Rod, Alexander Melnikov, & Keng Meng Ng. (2015). OnΔ20-categoricity of equivalence relations. Annals of Pure and Applied Logic. 166(9). 851–880. 7 indexed citations
16.
Melnikov, Alexander & Keng Meng Ng. (2015). Computable structures and operations on the space of continuous functions. Fundamenta Mathematicae. 1–41. 10 indexed citations
17.
Miller, Russell, et al.. (2014). COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY. Journal of Symbolic Logic. 79(3). 859–881. 9 indexed citations
18.
Downey, Rod & Keng Meng Ng. (2012). Lowness for bounded randomness. Theoretical Computer Science. 460. 1–9. 1 indexed citations
19.
Barmpalias, George, Rod Downey, & Keng Meng Ng. (2011). Jump inversions inside effectively closed sets and applications to randomness. Journal of Symbolic Logic. 76(2). 491–518. 6 indexed citations
20.
Ng, Keng Meng. (2008). On strongly jump traceable reals. Annals of Pure and Applied Logic. 154(1). 51–69. 11 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Douglas Cenzer Breakdown of academic impact, for papers by Andreas Weiermann Breakdown of academic impact, for papers by Valentina Harizanov Breakdown of academic impact, for papers by I. Sh. Kalimullin Breakdown of academic impact, for papers by Russell Miller Breakdown of academic impact, for papers by Alberto Marcone Breakdown of academic impact, for papers by Piergiorgio Odifreddi Breakdown of academic impact, for papers by Maksim Zhukovskii Breakdown of academic impact, for papers by Sebastiaan A. Terwijn Breakdown of academic impact, for papers by Alexander Melnikov
Rankless by CCL
2026