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 Sartaj Sahni'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 Sartaj Sahni with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Sartaj Sahni more than expected).
This network shows the impact of papers produced by Sartaj Sahni. 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 Sartaj Sahni. The network helps show where Sartaj Sahni may publish in the future.
Co-authorship network of co-authors of Sartaj Sahni
This figure shows the co-authorship network connecting the top 25 collaborators of Sartaj Sahni.
A scholar is included among the top collaborators of Sartaj Sahni 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 Sartaj Sahni. Sartaj Sahni is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Xu, Xiaochun, Sartaj Sahni, & Nageswara S. V. Rao. (2008). On basic properties of localization using distance-difference measurements. Civil War Book Review. 1–8.9 indexed citations
Sahni, Sartaj, et al.. (1998). BPC Permutations on the OTIS-Hypercube Optoelectronic Computer.. Informatica (slovenia). 22.20 indexed citations
5.
Horowitz, Ellis, et al.. (1997). Computer Algorithms in Pseudocode: The Human Dimension.4 indexed citations
6.
Sahni, Sartaj. (1997). Data Structures, Algorithms, and Applications in C++.46 indexed citations
7.
López, Mario A., Ravi Janardan, & Sartaj Sahni. (1993). A fast algorithm for VLSI net extraction. International Conference on Computer Aided Design. 770–774.3 indexed citations
Lee, Jong, Sartaj Sahni, & Eugene Shragowitz. (1987). A Hypecube Algorithm for the 0/1 Knapsack Problem.. Proceedings of the International Conference on Parallel Processing. 699–706.3 indexed citations
13.
Sahni, Sartaj, et al.. (1987). ALL PAIRS SHORTEST PATHS ON A HYPERCUBE MULTIPROCESSOR.. Proceedings of the International Conference on Parallel Processing. 713–716.39 indexed citations
Sahni, Sartaj, et al.. (1982). Optimal Single Row Router. Design Automation Conference. 38–45.8 indexed citations
18.
Dekel, Eliezer & Sartaj Sahni. (1982). A parallel matching algorithm for convex bipartite graphs.. Proceedings of the International Conference on Parallel Processing. 178–184.4 indexed citations
19.
Dekel, Eliezer & Sartaj Sahni. (1982). Parallel generation of the postfix form.. Proceedings of the International Conference on Parallel Processing. 171–177.1 indexed citations
20.
Sahni, Sartaj, et al.. (1981). Preemptive Scheduling Of Uniform Processors With Memory.3 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.