Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
This map shows the geographic impact of Chita R. Das'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 Chita R. Das with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chita R. Das more than expected).
This network shows the impact of papers produced by Chita R. Das. 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 Chita R. Das. The network helps show where Chita R. Das may publish in the future.
Co-authorship network of co-authors of Chita R. Das
This figure shows the co-authorship network connecting the top 25 collaborators of Chita R. Das.
A scholar is included among the top collaborators of Chita R. Das 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 Chita R. Das. Chita R. Das is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Sarhan, Nabil J. & Chita R. Das. (2004). A new class of scheduling policies for providing time of service guarantees in Video-On-Demand servers.
13.
Sarhan, Nabil J. & Chita R. Das. (2004). Analysis of caching performance in multimedia servers. 288–293.1 indexed citations
14.
Das, Chita R., et al.. (1995). Processor Management Techniques for Mesh-Connected Multiprocessors.. Proceedings of the International Conference on Parallel Processing. 105–112.11 indexed citations
15.
Kim, Jong & Chita R. Das. (1995). Modeling wormhole routing in a hypercube. IEEE Computer Society Press eBooks. 383–390.3 indexed citations
16.
Kim, Jong, Chita R. Das, & Woei Lin. (1994). A top-down processor allocation scheme for hypercube computers. IEEE Computer Society Press eBooks. 620–630.9 indexed citations
17.
Das, Chita R., et al.. (1991). A Cache-Based Checkpointing Scheme for MIN-Based Multiprocessors.. Proceedings of the International Conference on Parallel Processing. 497–500.3 indexed citations
18.
Das, Chita R., et al.. (1990). Fault-Tolerant Task Mapping Algorithms for MIN-Based Multiprocessors.. Proceedings of the International Conference on Parallel Processing. 445–448.1 indexed citations
Kim, Jong, Chita R. Das, & Woei Lin. (1989). A Processor Allocation Scheme for Hypercube Computers.. Proceedings of the International Conference on Parallel Processing. 2. 231–238.24 indexed citations
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.