Ramamohan Paturi
- Computational Theory and Mathematics top 0.2%
- Artificial Intelligence top 2%
- Computer Networks and Communications top 2%
- Electrical and Electronic Engineering
- Computer Graphics and Computer-Aided Design top 2%
- Co-authors
- Russell ImpagliazzoFrancis ZaneMichael SaksJános KomlósJanoš ŠimonPavel PudlákSadik C. EsenerKirill Levchenko
- Topics
- Complexity and Algorithms in Graphs (25 papers)Advanced Graph Theory Research (20 papers)Machine Learning and Algorithms (10 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
- Partner nations
- United StatesGermanyNorway
In The Last Decade
Ramamohan Paturi
61 papers receiving 1.9k citations
Hit Papers
Peers
Comparison fields: 5 of 84
- Computational Theory and Mathematics 1.5k
- Artificial Intelligence 802
- Computer Networks and Communications 660
- Electrical and Electronic Engineering 283
- Computer Graphics and Computer-Aided Design 117
Countries citing papers authored by Ramamohan Paturi
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.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 30 | |
| 3 | Nondeterministic extensions of the Strong Exponential Time Hypothesis and consequences for non-reducibility. | 1 |
| 4 | 10 | |
| 5 | Good Edge, Bad Edge: How Network Structure Affects a Group's Ability to Coordinate | 2 |
| 6 | 19 | |
| 7 | 19 | |
| 8 | 8 | |
| 9 | 12 | |
| 10 | 364 | |
| 11 | Which Problems Have Strongly Exponential Complexity?breakdown → | 539 |
| 12 | 8 | |
| 13 | 27 | |
| 14 | Convergence analysis of associative memories | 0 |
| 15 | 11 | |
| 16 | 2 | |
| 17 | 11 | |
| 18 | 3 | |
| 19 | 59 | |
| 20 | 65 |
About Ramamohan Paturi
Ramamohan Paturi is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence, having authored 65 papers that have together received 2.1k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (25 papers), Advanced Graph Theory Research (20 papers) and Machine Learning and Algorithms (10 papers). The work is most often cited by research in Computational Theory and Mathematics (1.5k citations), Discrete Mathematics and Combinatorics (110 citations) and Computer Graphics and Computer-Aided Design (117 citations). Ramamohan Paturi has collaborated with scholars based in United States, Germany and Norway. Frequent co-authors include Russell Impagliazzo, Francis Zane, Michael Saks, János Komlós, Janoš Šimon, Pavel Pudlák, Sadik C. Esener, Kirill Levchenko, Mathew D. McCubbins and Nicholas Weller. Their work appears in journals such as PLoS ONE, Journal of the ACM and Neural Networks.
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.