Jim Kadin
About
In The Last Decade
Jim Kadin
16 papers receiving 245 citations
Peers
Comparison fields: 5 of 23
- Computational Theory and Mathematics 223
- Artificial Intelligence 163
- Computer Networks and Communications 44
- Management Science and Operations Research 12
- Signal Processing 10
Countries citing papers authored by Jim Kadin
This map shows the geographic impact of Jim Kadin'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 Jim Kadin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jim Kadin more than expected).
Fields of papers citing papers by Jim Kadin
This network shows the impact of papers produced by Jim Kadin. 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 Jim Kadin. The network helps show where Jim Kadin may publish in the future.
Co-authorship network of co-authors of Jim Kadin
This figure shows the co-authorship network connecting the top 25 collaborators of Jim Kadin. A scholar is included among the top collaborators of Jim Kadin 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 Jim Kadin. Jim Kadin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 5 | |
| 2 | 4 | |
| 3 | 7 | |
| 4 | 5 | |
| 5 | 32 | |
| 6 | 10 | |
| 7 | 28 | |
| 8 | On the Structure of Uniquely Satisfiable Formulas | 3 |
| 9 | 54 | |
| 10 | 74 | |
| 11 | 12 | |
| 12 | 1 | |
| 13 | P NP [log n] and sparse turing complete sets for NP. | 14 |
| 14 | 6 | |
| 15 | Deterministic Polynomial Time O(log n) Queries | 2 |
| 16 | 19 |
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.