Desh Ranjan
About
In The Last Decade
Desh Ranjan
29 papers receiving 468 citations
Peers
Comparison fields: 5 of 63
- Computational Theory and Mathematics 187
- Computer Networks and Communications 186
- Artificial Intelligence 182
- Signal Processing 58
- Statistics and Probability 56
Countries citing papers authored by Desh Ranjan
This map shows the geographic impact of Desh Ranjan'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 Desh Ranjan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Desh Ranjan more than expected).
Fields of papers citing papers by Desh Ranjan
This network shows the impact of papers produced by Desh Ranjan. 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 Desh Ranjan. The network helps show where Desh Ranjan may publish in the future.
Co-authorship network of co-authors of Desh Ranjan
This figure shows the co-authorship network connecting the top 25 collaborators of Desh Ranjan. A scholar is included among the top collaborators of Desh Ranjan 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 Desh Ranjan. Desh Ranjan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 9 | |
| 3 | Some Separation Results Between Classes of Pointer Algorithms. | 0 |
| 4 | 1 | |
| 5 | 1 | |
| 6 | 2 | |
| 7 | 4 | |
| 8 | 2 | |
| 9 | An optimal data structure to handle dynamic environments in non-deterministic computations. | 1 |
| 10 | 1 | |
| 11 | 3 | |
| 12 | 7 | |
| 13 | 137 | |
| 14 | 18 | |
| 15 | 19 | |
| 16 | 36 | |
| 17 | The circuit subfunction relations are $sum^P_2$-complete | 1 |
| 18 | 2 | |
| 19 | 22 | |
| 20 | On Unique Staisfiability and Randomized Reductions. | 3 |
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.