C.-H. Luke Ong
- Artificial Intelligence top 1%
- Computational Theory and Mathematics top 0.5%
- Computer Networks and Communications top 5%
- Software top 5%
- Hardware and Architecture top 5%
- Co-authors
- J. M. E. HylandSamson AbramskySteven RamsayAndrzej S. MurawskiNaoki KobayashiCharles StewartMatthew HagueGordon Wilfong
- Topics
- Logic, programming, and type systems (55 papers)Formal Methods in Verification (45 papers)Logic, Reasoning, and Knowledge (38 papers)
- Journals
- Artificial IntelligenceACM SIGCOMM Computer Communication ReviewTheoretical Computer Science
- Partner nations
- United KingdomSingaporeJapan
In The Last Decade
C.-H. Luke Ong
72 papers receiving 1.3k citations
Peers
Comparison fields: 5 of 31
- Artificial Intelligence 1.2k
- Computational Theory and Mathematics 974
- Computer Networks and Communications 177
- Software 151
- Hardware and Architecture 90
Countries citing papers authored by C.-H. Luke Ong
This map shows the geographic impact of C.-H. Luke Ong'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 C.-H. Luke Ong with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites C.-H. Luke Ong more than expected).
Fields of papers citing papers by C.-H. Luke Ong
This network shows the impact of papers produced by C.-H. Luke Ong. 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 C.-H. Luke Ong. The network helps show where C.-H. Luke Ong may publish in the future.
Co-authorship network of co-authors of C.-H. Luke Ong
This figure shows the co-authorship network connecting the top 25 collaborators of C.-H. Luke Ong. A scholar is included among the top collaborators of C.-H. Luke Ong 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 C.-H. Luke Ong. C.-H. Luke Ong is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | Higher-Order Constrained Horn Clauses for Verification | 3 |
| 4 | 2 | |
| 5 | 13 | |
| 6 | 4 | |
| 7 | ∃GUARANTEENASH for Boolean games is NEXP-Hard | 4 |
| 8 | 6 | |
| 9 | 2 | |
| 10 | 4 | |
| 11 | 9 | |
| 12 | 13 | |
| 13 | 31 | |
| 14 | 4 | |
| 15 | 4 | |
| 16 | 10 | |
| 17 | 18 | |
| 18 | 282 | |
| 19 | A Semantic View of Classical Proofs: Type-Theoretic, Categorical, and Denotational Characterizations (Preliminary Extended Abstract). | 7 |
| 20 | 130 |
About C.-H. Luke Ong
C.-H. Luke Ong is a scholar working on Computational Theory and Mathematics, Software and Artificial Intelligence, having authored 78 papers that have together received 1.3k indexed citations. Recurring topics across this work include Logic, programming, and type systems (55 papers), Formal Methods in Verification (45 papers) and Logic, Reasoning, and Knowledge (38 papers). The work is most often cited by research in Computational Theory and Mathematics (974 citations), Software (151 citations) and Artificial Intelligence (1.2k citations). C.-H. Luke Ong has collaborated with scholars based in United Kingdom, Singapore and Japan. Frequent co-authors include J. M. E. Hyland, Samson Abramsky, Steven Ramsay, Andrzej S. Murawski, Naoki Kobayashi, Charles Stewart, Matthew Hague, Gordon Wilfong, F. Bruce Shepherd and Olivier Serre. Their work appears in journals such as Artificial Intelligence, ACM SIGCOMM Computer Communication Review and Theoretical Computer Science.
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.