Neng‐Fa Zhou
About
In The Last Decade
Neng‐Fa Zhou
35 papers receiving 296 citations
Peers
Comparison fields: 5 of 35
- Artificial Intelligence 245
- Computer Networks and Communications 109
- Computer Vision and Pattern Recognition 91
- Computational Theory and Mathematics 87
- Software 33
Countries citing papers authored by Neng‐Fa Zhou
This map shows the geographic impact of Neng‐Fa Zhou'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 Neng‐Fa Zhou with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Neng‐Fa Zhou more than expected).
Fields of papers citing papers by Neng‐Fa Zhou
This network shows the impact of papers produced by Neng‐Fa Zhou. 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 Neng‐Fa Zhou. The network helps show where Neng‐Fa Zhou may publish in the future.
Co-authorship network of co-authors of Neng‐Fa Zhou
This figure shows the co-authorship network connecting the top 25 collaborators of Neng‐Fa Zhou. A scholar is included among the top collaborators of Neng‐Fa Zhou 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 Neng‐Fa Zhou. Neng‐Fa Zhou is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 1 | |
| 3 | 23 | |
| 4 | Compiling and Executing PDDL in Picat. | 0 |
| 5 | 4 | |
| 6 | 1 | |
| 7 | 8 | |
| 8 | 7 | |
| 9 | 2 | |
| 10 | 1 | |
| 11 | Generative modeling with failure in PRISM | 16 |
| 12 | 2 | |
| 13 | 22 | |
| 14 | 1 | |
| 15 | A high-level intermediate language and the algorithms for compiling finite-domain constraints | 5 |
| 16 | A Novel Implementation Method of Delay. | 2 |
| 17 | An Efficient Finite-Domain Constraint Solver in Beta-Prolog | 1 |
| 18 | On the direct parameter passing mechanism for Prolog compilers | 0 |
| 19 | 2 | |
| 20 | 9 |
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.