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.
Scalable high performance main memory system using phase-change memory technology
20091000 citationsMoinuddin K. Qureshi et al.profile →
Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches
2006804 citationsMoinuddin K. Qureshi, Yale N. Pattprofile →
Enhancing lifetime and security of PCM-based main memory with start-gap wear leveling
2009614 citationsMoinuddin K. Qureshi et al.profile →
Adaptive insertion policies for high performance caching
2007442 citationsMoinuddin K. Qureshi, Aamer Jaleel et al.profile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Moinuddin K. Qureshi
Since
Specialization
Citations
This map shows the geographic impact of Moinuddin K. Qureshi'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 Moinuddin K. Qureshi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Moinuddin K. Qureshi more than expected).
Fields of papers citing papers by Moinuddin K. Qureshi
This network shows the impact of papers produced by Moinuddin K. Qureshi. 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 Moinuddin K. Qureshi. The network helps show where Moinuddin K. Qureshi may publish in the future.
Co-authorship network of co-authors of Moinuddin K. Qureshi
This figure shows the co-authorship network connecting the top 25 collaborators of Moinuddin K. Qureshi.
A scholar is included among the top collaborators of Moinuddin K. Qureshi 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 Moinuddin K. Qureshi. Moinuddin K. Qureshi is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Prakash, Atul, et al.. (2021). Protecting DNNs from Theft using an Ensemble of Diverse Models. International Conference on Learning Representations.4 indexed citations
Huang, Jian, Moinuddin K. Qureshi, & Karsten Schwan. (2016). An evolutionary study of Linux memory management for fun and profit. USENIX Annual Technical Conference. 465–478.10 indexed citations
14.
Nair, Prashant J., David Roberts, & Moinuddin K. Qureshi. (2015). F ault S im. ACM Transactions on Architecture and Code Optimization. 12(4). 1–24.21 indexed citations
Qureshi, Moinuddin K., Aamer Jaleel, Yale N. Patt, Simon C. Steely, & Joel Emer. (2008). S-D-C A I H-P C. IEEE Micro. 28(1). 91–98.10 indexed citations
Qureshi, Moinuddin K. & Yale N. Patt. (2006). Utility-Based Cache Partitioning: A Low-Overhead, High-Performance, Runtime Mechanism to Partition Shared Caches. 423–432.804 indexed citations breakdown →
20.
Qureshi, Moinuddin K., et al.. (2006). Line distillation: A mechanism to improve cache utilization.1 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.