Susmit Sarkar
About
In The Last Decade
Susmit Sarkar
36 papers receiving 1.2k citations
Peers
Comparison fields: 5 of 40
- Hardware and Architecture 923
- Computer Networks and Communications 844
- Artificial Intelligence 614
- Computational Theory and Mathematics 190
- Electrical and Electronic Engineering 128
Countries citing papers authored by Susmit Sarkar
This map shows the geographic impact of Susmit Sarkar'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 Susmit Sarkar with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Susmit Sarkar more than expected).
Fields of papers citing papers by Susmit Sarkar
This network shows the impact of papers produced by Susmit Sarkar. 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 Susmit Sarkar. The network helps show where Susmit Sarkar may publish in the future.
Co-authorship network of co-authors of Susmit Sarkar
This figure shows the co-authorship network connecting the top 25 collaborators of Susmit Sarkar. A scholar is included among the top collaborators of Susmit Sarkar 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 Susmit Sarkar. Susmit Sarkar 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 | 2 | |
| 3 | 23 | |
| 4 | 75 | |
| 5 | 10 | |
| 6 | 1 | |
| 7 | 1 | |
| 8 | 4 | |
| 9 | 53 | |
| 10 | 16 | |
| 11 | 77 | |
| 12 | 27 | |
| 13 | 71 | |
| 14 | 237 | |
| 15 | Mathematizing C++ Concurrency: The Post-Rapperswil Model | 6 |
| 16 | 46 | |
| 17 | Relaxed memory models must be rigorous | 10 |
| 18 | 16 | |
| 19 | A dependently typed programming language, with applications to foundational certified code systems | 3 |
| 20 | 1 |
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.