2026 Christos H. Papadimitriou: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	133	93	90	58	56	468	85753

Research.com Recognitions

2026 - Research.com Computer Science in United States Leader Award
2025 - Research.com Computer Science in United States Leader Award
2023 - Research.com Computer Science in United States Leader Award
2022 - Research.com Computer Science in United States Leader Award
2016 - IEEE John von Neumann Medal "For providing a deeper understanding of computational complexity and its implications for approximation algorithms, artificial intelligence, economics, database theory, and biology."
2009 - Member of the National Academy of Sciences
2006 - Member of Academia Europaea
2002 - Member of the National Academy of Engineering For contributions to complexity theory, database theory, and combinatorial optimization.
2001 - ACM Fellow For outstanding contributions to complexity theory, database theory and combinatorial optimization.
2001 - Fellow of the American Academy of Arts and Sciences

Overview

Christos H. Papadimitriou is affiliated with Columbia University in the United States and conducts research primarily in the field of Computer Science. Their work spans multiple subfields including Artificial Intelligence, Cognitive Neuroscience, Electrical and Electronic Engineering, Economics and Econometrics, and Management Science and Operations Research.

The scientist's research addresses main topics such as:

Neural dynamics and brain function
Advanced Memory and Neural Computing
Neural Networks and Applications
Neuroscience and Neural Engineering
Game Theory and Voting Systems
Game Theory and Applications
Economic theories and models

Recent publications by Papadimitriou include:

Brain computation by assemblies of neurons, 2020, Proceedings of the National Academy of Sciences
Bridging the Gap Between Neurons and Cognition Through Assemblies of Neurons, 2021, Neural Computation
A Model for Structured Information Representation in Neural Networks of the Brain, 2020, eNeuro
Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria, 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
On Limitations of the Transformer Architecture, 2024, arXiv (Cornell University)

Frequent co-authors collaborating with Papadimitriou include:

Daniel Mitropolsky
Binghui Peng
Santosh Vempala
Mihalis Yannakakis
Wolfgang Maass

Most publications appear in venues such as:

arXiv (Cornell University)
Neural Computation
Games and Economic Behavior
Proceedings of the National Academy of Sciences
eNeuro

Throughout their career, Papadimitriou has been recognized with several awards, including:

IEEE John von Neumann Medal, 2016, for contributions spanning computational complexity, approximation algorithms, artificial intelligence, economics, database theory, and biology
Member of the National Academy of Sciences, 2009
Member of Academia Europaea, 2006
Member of the National Academy of Engineering, 2002, for work in complexity theory, database theory, and combinatorial optimization
ACM Fellow, 2001, acknowledging contributions to complexity theory, database theory, and combinatorial optimization
Fellow of the American Academy of Arts and Sciences, 2001

Best Publications

Combinatorial optimization: algorithms and complexity

Christos H. Papadimitriou;Kenneth Steiglitz

13541
Citations
Worst-case equilibria

Elias Koutsoupias;Christos Papadimitriou

3309
Citations
Optimization, approximation, and complexity classes

Christos H. Papadimitriou;Mihalis Yannakakis

2735
Citations
Elements of the Theory of Computation

Harry R. Lewis;Christos H. Papadimitriou

2708
Citations
The Complexity of Computing a Nash Equilibrium

Constantinos Daskalakis;Paul W. Goldberg;Christos H. Papadimitriou

2662
Citations
The Complexity of Markov Decision Processes

Christos H. Papadimitriou;John N. Tsitsiklis

1766
Citations
Latent semantic indexing: a probabilistic analysis

Christos H. Papadimitriou;Hisao Tamaki;Prabhakar Raghavan;Santosh Vempala

1636
Citations
Algorithms, games, and the internet

Christos Papadimitriou

1577
Citations
The serializability of concurrent database updates

Christos H. Papadimitriou

1291
Citations
Geographic routing without location information

Ananth Rao;Sylvia Ratnasamy;Christos Papadimitriou;Scott Shenker

1099
Citations
The Euclidean travelling salesman problem is NP-complete

Christos H. Papadimitriou

1099
Citations
On generating all maximal independent sets

David S. Johnson;Christos H. Papadimitriou

1064
Citations
How easy is local search

David S. Johnson;Christos H. Papadimitriou;Mihalis Yannakakis

996
Citations
On the complexity of the parity argument and other inefficient proofs of existence

Christos H. Papadimitriou

973
Citations
The discrete geodesic problem

Joseph S. B. Mitchell;David M. Mount;Christos H. Papadimitriou

925
Citations
The Complexity of Multiterminal Cuts

E. Dahlhaus;D. S. Johnson;C. H. Papadimitriou;P. D. Seymour

901
Citations
Shortest paths without a map

Christos H. Papadimitriou;Mihalis Yannakakis

840
Citations
The complexity of pure Nash equilibria

Alex Fabrikant;Christos Papadimitriou;Kunal Talwar

834
Citations
A simple algorithm for finding frequent elements in streams and bags

Richard M. Karp;Scott Shenker;Christos H. Papadimitriou

808
Citations
On the complexity of integer programming

Christos H. Papadimitriou

775
Citations
Latent Semantic Indexing

Christos H. Papadimitriou;Prabhakar Raghavan;Hisao Tamaki;Santosh Vempala

581
Citations

Frequent Co-Authors

Mihalis Yannakakis Columbia University

Constantinos Daskalakis MIT

Elias Koutsoupias University of Oxford

Santosh Vempala Georgia Institute of Technology

Xiaotie Deng Peking University

Richard M. Karp University of California, Berkeley

Wolfgang Maass Graz University of Technology

Scott Shenker University of California, Berkeley

Prabhakar Raghavan Google (United States)

Phokion G. Kolaitis University of California, Santa Cruz

External Links

Wikipedia of Christos H. Papadimitriou Personal website of Christos H. Papadimitriou Google Scholar page

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

Related Online Degrees & Career Pathways

Exploring Computer Science can open doors to numerous related fields and flexible learning options. Many students consider online programs, which offer both convenience and access to top-ranked courses. If you're interested in technical fields, be sure to check the online electrical engineering degree ranking to find reputable programs that complement computer science skills.

Rapidly evolving industries also value certifications that build specialized knowledge quickly. Review certifications for jobs to discover targeted credentials that can lead to lucrative roles and boost employability.

For those aiming to advance without investing years in graduate school, the fastest masters degree online may offer an efficient route toward career progression. Additionally, pursuing one of the most in demand masters degrees ensures your skillset matches current market needs and future trends.

Whether you seek flexibility, high salaries, or rapid advancement, exploring these academic and career pathways can help you design a future in technology that aligns with your goals.