Nahum Shimkin
About
In The Last Decade
Nahum Shimkin
78 papers receiving 2.0k citations
Peers
Comparison fields: 5 of 96
- Management Information Systems 751
- Computer Networks and Communications 728
- Management Science and Operations Research 657
- Electrical and Electronic Engineering 538
- Artificial Intelligence 362
Countries citing papers authored by Nahum Shimkin
This map shows the geographic impact of Nahum Shimkin'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 Nahum Shimkin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Nahum Shimkin more than expected).
Fields of papers citing papers by Nahum Shimkin
This network shows the impact of papers produced by Nahum Shimkin. 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 Nahum Shimkin. The network helps show where Nahum Shimkin may publish in the future.
Co-authorship network of co-authors of Nahum Shimkin
This figure shows the co-authorship network connecting the top 25 collaborators of Nahum Shimkin. A scholar is included among the top collaborators of Nahum Shimkin 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 Nahum Shimkin. Nahum Shimkin 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 | 1 | |
| 3 | 26 | |
| 4 | PAC Bandits with Risk Constraints. | 5 |
| 5 | Deep Reinforcement Learning with Averaged Target DQN. | 8 |
| 6 | PAC lower bounds and efficient algorithms for the max K-armed bandit problem | 2 |
| 7 | Response-based approachability with applications to generalized no-regret problems | 0 |
| 8 | Opportunistic Strategies for Generalized No-Regret Problems | 2 |
| 9 | 30 | |
| 10 | Online Classification with Specificity Constraints | 5 |
| 11 | Adaptive Aggregation for Reinforcement Learning with Efficient Exploration: Deterministic Domains. | 4 |
| 12 | Data association in multi target tracking using cross entropy based algorithms | 4 |
| 13 | 1 | |
| 14 | 4 | |
| 15 | THE IMPACT OF DELAY ANNOUNCEMENTS IN MANY-SERVER QUEUES WITH ABANDONMENT: SUPPLEMENTARY MATERIAL | 9 |
| 16 | A Geometric Approach to Multi-Criterion Reinforcement Learning | 62 |
| 17 | 1 | |
| 18 | The Steering Approach for Multi-Criteria Reinforcement Learning | 20 |
| 19 | 33 | |
| 20 | 16 |
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.