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.
Which Problems Have Strongly Exponential Complexity?
2001539 citationsRussell Impagliazzo, Ramamohan Paturi et al.Journal of Computer and System Sciencesprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
Countries citing papers authored by Ramamohan Paturi
Since
Specialization
Citations
This map shows the geographic impact of Ramamohan Paturi'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 Ramamohan Paturi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ramamohan Paturi more than expected).
Fields of papers citing papers by Ramamohan Paturi
This network shows the impact of papers produced by Ramamohan Paturi. 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 Ramamohan Paturi. The network helps show where Ramamohan Paturi may publish in the future.
Co-authorship network of co-authors of Ramamohan Paturi
This figure shows the co-authorship network connecting the top 25 collaborators of Ramamohan Paturi.
A scholar is included among the top collaborators of Ramamohan Paturi 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 Ramamohan Paturi. Ramamohan Paturi is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Cygan, Marek, Holger Dell, Daniel Lokshtanov, et al.. (2016). On Problems as Hard as CNF-SAT. ACM Transactions on Algorithms. 12(3). 1–24.30 indexed citations
3.
Carmosino, Marco, et al.. (2015). Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility.. Electronic colloquium on computational complexity. 22. 148.1 indexed citations
4.
Impagliazzo, Russell, et al.. (2014). 0-1 Integer Linear Programming with a Linear Number of Constraints. eScholarship (California Digital Library). 21. 24.3 indexed citations
5.
McCubbins, Mathew D., et al.. (2009). Good Edge, Bad Edge: How Network Structure Affects a Group's Ability to Coordinate. OpenSIUC (Southern Illinois University Carbondale).2 indexed citations
6.
Levchenko, Kirill, Geoffrey M. Voelker, Ramamohan Paturi, & Stefan Savage. (2008). Xl. 15–26.19 indexed citations
Impagliazzo, Russell & Ramamohan Paturi. (2001). On the Complexity of k-SAT. Journal of Computer and System Sciences. 62(2). 367–375.364 indexed citations
14.
Impagliazzo, Russell, Ramamohan Paturi, & Francis Zane. (2001). Which Problems Have Strongly Exponential Complexity?. Journal of Computer and System Sciences. 63(4). 512–530.539 indexed citations breakdown →
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.