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.
Data clustering
19998.7k citationsM. Narasimha Murty et al.profile →
Genetic K-means algorithm
19991.2k citationsM. Narasimha Murty 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 M. Narasimha Murty
Since
Specialization
Citations
This map shows the geographic impact of M. Narasimha Murty'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 M. Narasimha Murty with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites M. Narasimha Murty more than expected).
Fields of papers citing papers by M. Narasimha Murty
This network shows the impact of papers produced by M. Narasimha Murty. 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 M. Narasimha Murty. The network helps show where M. Narasimha Murty may publish in the future.
Co-authorship network of co-authors of M. Narasimha Murty
This figure shows the co-authorship network connecting the top 25 collaborators of M. Narasimha Murty.
A scholar is included among the top collaborators of M. Narasimha Murty 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 M. Narasimha Murty. M. Narasimha Murty is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Murty, M. Narasimha, et al.. (2013). Compression Schemes for Mining Large Datasets: A Machine Learning Perspective. CERN Document Server (European Organization for Nuclear Research).2 indexed citations
7.
Murty, M. Narasimha, et al.. (2012). On the relation between K-means and PLSA. NOT FOUND REPOSITORY (Indian Institute of Science Bangalore).
8.
Murty, M. Narasimha. (2011). A Generalized Method of Hedonic Prices: Measuring Benefits from Reduced Urban Air Pollution. Digital Library Of The Commons Repository (Indiana University).6 indexed citations
Vijaya, P., M. Narasimha Murty, & D.K. Subramanian. (2005). Analysis of Leader based Clustering Algorithms for Pattern Classification.. Indian International Conference on Artificial Intelligence. 2072–2091.1 indexed citations
15.
Vijaya, P., M. Narasimha Murty, & D.K. Subramanian. (2004). An Efficient Hierarchical Clustering Algorithm for Protein Sequences.. 1. 61–75.2 indexed citations
Ananthanarayana, V. S., M. Narasimha Murty, & D.K. Subramanian. (2001). Efficient clustering of large data sets. Pattern Recognition. 34(12). 2561–2563.11 indexed citations
18.
Murty, M. Narasimha. (1993). Theta Functions.1 indexed citations
19.
Shekar, B. H., M. Narasimha Murty, & G. Krishna. (1987). Pattern clustering: an artificial intelligence approach. International Joint Conference on Artificial Intelligence. 214–216.
20.
Shekar, B. H., M. Narasimha Murty, & G. Krishna. (1987). A FRAMEWORK FOR THE SYNTHESIS OF KNOWLEDGE-DIRECTED PATTERN CLASSES. 81–85.
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.