Haim Gaifman
About
In The Last Decade
Haim Gaifman
44 papers receiving 764 citations
Peers
Comparison fields: 5 of 66
- Artificial Intelligence 585
- Computational Theory and Mathematics 420
- Philosophy 125
- Experimental and Cognitive Psychology 119
- History and Philosophy of Science 118
Countries citing papers authored by Haim Gaifman
This map shows the geographic impact of Haim Gaifman'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 Haim Gaifman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Haim Gaifman more than expected).
Fields of papers citing papers by Haim Gaifman
This network shows the impact of papers produced by Haim Gaifman. 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 Haim Gaifman. The network helps show where Haim Gaifman may publish in the future.
Co-authorship network of co-authors of Haim Gaifman
This figure shows the co-authorship network connecting the top 25 collaborators of Haim Gaifman. A scholar is included among the top collaborators of Haim Gaifman 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 Haim Gaifman. Haim Gaifman 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 | 7 | |
| 3 | 8 | |
| 4 | 19 | |
| 5 | 6 | |
| 6 | 4 | |
| 7 | 54 | |
| 8 | Semantics of Logic Programs. | 10 |
| 9 | 5 | |
| 10 | 45 | |
| 11 | Operational pointer semantics: solution to self-referential puzzles I | 17 |
| 12 | Decidable Optimization Problems for Database Logic Programs (Preliminary Report) | 17 |
| 13 | Partial Order Models of Concurrency and the Computation of Functions | 31 |
| 14 | A simple proof that connectivity of finite graphs is not first-order definable. | 7 |
| 15 | 50 | |
| 16 | 0 | |
| 17 | 4 | |
| 18 | 146 | |
| 19 | 145 | |
| 20 | 68 |
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.