Philip Fong
- Artificial Intelligence top 10%
- Electrical and Electronic Engineering
- Discrete Mathematics and Combinatorics top 5%
- Aerospace Engineering top 10%
- Computer Vision and Pattern Recognition top 10%
- Co-authors
- J. L. AlperinMario E. MunichEthan EadeHans‐Peter SeidelJens-Steffen GutmannRobert D. CameronMichael KrügerStuart G. Stubblebine
- Topics
- Security and Verification in Computing (13 papers)Logic, programming, and type systems (10 papers)Distributed systems and fault tolerance (9 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided DesignGeometry and Topology
- Partner nations
- CanadaUnited StatesJapan
In The Last Decade
Philip Fong
38 papers receiving 564 citations
Peers
Comparison fields: 5 of 76
- Artificial Intelligence 201
- Electrical and Electronic Engineering 145
- Discrete Mathematics and Combinatorics 143
- Aerospace Engineering 118
- Computer Vision and Pattern Recognition 99
Countries citing papers authored by Philip Fong
This map shows the geographic impact of Philip Fong'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 Philip Fong with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Philip Fong more than expected).
Fields of papers citing papers by Philip Fong
This network shows the impact of papers produced by Philip Fong. 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 Philip Fong. The network helps show where Philip Fong may publish in the future.
Co-authorship network of co-authors of Philip Fong
This figure shows the co-authorship network connecting the top 25 collaborators of Philip Fong. A scholar is included among the top collaborators of Philip Fong 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 Philip Fong. Philip Fong is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 9 | |
| 3 | 1 | |
| 4 | 15 | |
| 5 | 1 | |
| 6 | Link-Time Enforcement of Confined Types for JVM Bytecode. | 3 |
| 7 | 20 | |
| 8 | Proof linking: distributed verification of java classfiles in the presence of multiple classloaders | 4 |
| 9 | 23 | |
| 10 | 1 | |
| 11 | Design Patterns for Planning Systems | 1 |
| 12 | 10 | |
| 13 | 34 | |
| 14 | 9 | |
| 15 | 72 | |
| 16 | 5 | |
| 17 | 1 | |
| 18 | 23 | |
| 19 | 75 | |
| 20 | 3 |
About Philip Fong
Philip Fong is a scholar working on Discrete Mathematics and Combinatorics, Instrumentation and Computer Graphics and Computer-Aided Design, having authored 39 papers that have together received 628 indexed citations. Recurring topics across this work include Security and Verification in Computing (13 papers), Logic, programming, and type systems (10 papers) and Distributed systems and fault tolerance (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (143 citations), Computer Graphics and Computer-Aided Design (43 citations) and Geometry and Topology (74 citations). Philip Fong has collaborated with scholars based in Canada, United States and Japan. Frequent co-authors include J. L. Alperin, Mario E. Munich, Ethan Eade, Hans‐Peter Seidel, Jens-Steffen Gutmann, Robert D. Cameron, Michael Krüger, Stuart G. Stubblebine, Prémkumar Dévanbu and N. Burgoyne. Their work appears in journals such as Science, Journal of Theoretical Biology and The International Journal of Robotics Research.
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.