World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
30
Citations
8149
World Ranking
13845
National Ranking
5502

Overview

Ramamohan Paturi is affiliated with the University of California, San Diego in the United States. Their research primarily focuses on computer science, with specialization in computational theory and mathematics, artificial intelligence, information systems, numerical analysis, and industrial and manufacturing engineering.

Their work covers several main topics, including advanced graph theory research, advanced optimization algorithms research, vehicle routing optimization methods, topic modeling, information retrieval and search behavior, expert finding and Q&A systems, as well as advanced algebra and logic.

Ramamohan Paturi has published papers in a variety of venues, most notably:

  • arXiv (Cornell University)
  • Zenodo (CERN European Organization for Nuclear Research)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Recent publications include:

  • "The Fine-Grained Complexity of Multi-Dimensional Ordering Properties", 2021, arXiv (Cornell University)
  • "DORIS-MAE: Scientific Document Retrieval using Multi-level Aspect-based Queries", 2023, arXiv (Cornell University)
  • "BIRCO: A Benchmark of Information Retrieval Tasks with Complex Objectives", 2024, arXiv (Cornell University)
  • "IR2: Information Regularization for Information Retrieval", 2024, arXiv (Cornell University)
  • "Local Enumeration and Majority Lower Bounds", 2024, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent co-authors working with Ramamohan Paturi include:

  • Leon Bergen
  • Xiaoyue Wang
  • Weili Cao
  • Kaicheng Wang
  • Jianyou Wang

The scope of Ramamohan Paturi's research encompasses theoretical and applied domains of computer science with a particular emphasis on computational theory, algorithmic complexity, and information retrieval. Their publications span various aspects of optimization, graph theory, and search methodologies, contributing to emerging techniques in these areas.

Best Publications

  • Which Problems Have Strongly Exponential Complexity

    Russell Impagliazzo;Ramamohan Paturi;Francis Zane

  • On the complexity of K -SAT

    Russell Impagliazzo;Ramamohan Paturi

  • Complexity of k-SAT

    R. Impagliazzo;R. Paturi

  • An improved exponential-time algorithm for k-SAT

    Ramamohan Paturi;Pavel Pudlák;Michael E. Saks;Francis Zane

  • Satisfiability Coding Lemma.

    Ramamohan Paturi;Pavel Pudlák;Francis Zane

  • On Problems as Hard as CNF-SAT

    Marek Cygan;Holger Dell;Daniel Lokshtanov;Dániel Marx

  • On the degree of polynomials that approximate symmetric Boolean functions (preliminary version)

    Ramamohan Paturi

  • Probabilistic communication complexity

    Ramamohan Paturi;Janos Simon

  • An improved exponential-time algorithm for k-SAT

    R. Paturi;P. Pudlik;M.E. Saks;F. Zane

  • The Complexity of Satisfiability of Small Depth Circuits

    Chris Calabro;Russell Impagliazzo;Ramamohan Paturi

  • A duality between clause width and clause density for SAT

    C. Calabro;R. Impagliazzo;R. Paturi

  • Scalable Network Architectures Using the Optical Transpose Interconnection System (OTIS)

    Francis Zane;Philippe Marchand;Ramamohan Paturi;Sadik Esener

  • Nondeterministic Extensions of the Strong Exponential Time Hypothesis and Consequences for Non-reducibility

    Marco L. Carmosino;Jiawei Gao;Russell Impagliazzo;Ivan Mihajlin

  • On Problems as Hard as CNF-SAT

    Marek Cygan;Holger Dell;Daniel Lokshtanov;D'niel Marx

  • Which problems have strongly exponential complexity

    R. Impagliazzo;R. Paturi;F. Zane

  • Convergence results in an associative memory model

    János Komlós;Ramamohan Paturi

  • A satisfiability algorithm for AC0

    Russell Impagliazzo;William Matthews;Ramamohan Paturi

  • The complexity of Unique k-SAT: An Isolation Lemma for k-CNFs

    Chris Calabro;Russell Impagliazzo;Valentine Kabanets;Ramamohan Paturi

  • Connected Coordination: Network Structure and Group Coordination

    Mathew D. McCubbins;Ramamohan Paturi;Nicholas Weller

  • Size--Depth Tradeoffs for Threshold Circuits

    Russell Impagliazzo;Ramamohan Paturi;Michael E. Saks

  • Programmable Optoelectronic Multiprocessors And Their Comparison With Symbolic Substitution For Digital Optical Computing

    F. Kiamilev;Sadik C. Esener;R. Paturi;Y. Fainmar

  • A Satisfiability Algorithm for AC$^0$

    Russell Impagliazzo;William Matthews;Ramamohan Paturi

Frequent Co-Authors

Russell Impagliazzo
Russell Impagliazzo University of California, San Diego
Michael Saks
Michael Saks Rutgers, The State University of New Jersey
Sadik C. Esener
Sadik C. Esener University of California, San Diego
Daniel Lokshtanov
Daniel Lokshtanov University of California, Santa Barbara
Sing H. Lee
Sing H. Lee University of California, San Diego
Dániel Marx
Dániel Marx Saarland University
Saket Saurabh
Saket Saurabh Institute of Mathematical Sciences
Marek Cygan
Marek Cygan University of Warsaw
Dieter Kratsch
Dieter Kratsch University of Lorraine
Chung-Kuan Cheng
Chung-Kuan Cheng University of California, San Diego

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online education options in STEM fields opens up a variety of pathways for students and professionals interested in Computer Science and related disciplines. For those considering a broader impact on the environment, learning what can you get with an environmental science degree highlights career potential in fields like conservation, research, and public policy.

If speed and flexibility are top priorities, pursuing one of the fastest computer science degree options can help you enter the workforce quickly or advance your skills alongside your current job. Online degrees make it easier to balance study with other commitments.

Related science and engineering tracks also offer strong online opportunities. You can learn about programs like online environmental engineering degree science and engineering or dive into technical roles with online mechanical engineering degrees. These programs blend practical skills with strong job outlooks in both traditional and emerging industries.

Best Scientists Citing Ramamohan Paturi

Trending Scientists