World's Best Scientists 2026 revealed!
Christos H. Papadimitriou

Christos H. Papadimitriou

Award Badge
Computer Science
USA
2026

D-Index & Metrics

Computer Science

D-Index
133
Citations
85753
World Ranking
93
National Ranking
58

Christos H. Papadimitriou publication distribution in Computer Science in 2026

The chart shows the distribution of publications by all Research.com ranked scientists in the field of Computer Science in 2026. The highlighted bar marks where Christos H. Papadimitriou sits on this spectrum.

32–41 publications: 7 scientists 42–51 publications: 22 scientists 52–61 publications: 82 scientists 62–71 publications: 134 scientists 72–81 publications: 249 scientists 82–91 publications: 324 scientists 92–101 publications: 421 scientists 102–111 publications: 420 scientists 112–121 publications: 497 scientists 122–131 publications: 544 scientists 132–141 publications: 555 scientists 142–151 publications: 609 scientists 152–161 publications: 559 scientists 162–171 publications: 534 scientists 172–181 publications: 556 scientists 182–191 publications: 583 scientists 192–201 publications: 519 scientists 202–211 publications: 508 scientists 212–221 publications: 490 scientists 222–231 publications: 437 scientists 232–241 publications: 423 scientists 242–251 publications: 408 scientists 252–261 publications: 377 scientists 262–271 publications: 301 scientists 272–281 publications: 335 scientists 282–291 publications: 320 scientists 292–301 publications: 293 scientists 302–311 publications: 250 scientists 312–321 publications: 238 scientists 322–331 publications: 206 scientists 332–341 publications: 209 scientists 342–351 publications: 208 scientists 352–361 publications: 162 scientists 362–371 publications: 176 scientists 372–381 publications: 127 scientists 382–391 publications: 158 scientists 392–401 publications: 128 scientists 402–411 publications: 104 scientists 412–421 publications: 94 scientists 422–431 publications: 99 scientists 432–441 publications: 83 scientists 442–451 publications: 108 scientists 452–461 publications: 73 scientists 462–471 publications: 77 scientists 472–481 publications: 69 scientists 482–491 publications: 84 scientists 492–501 publications: 62 scientists 502–511 publications: 54 scientists 512–521 publications: 57 scientists 522–531 publications: 51 scientists 532–541 publications: 51 scientists 542–551 publications: 32 scientists 552–561 publications: 38 scientists 562–571 publications: 28 scientists 572–581 publications: 43 scientists 582–591 publications: 33 scientists 592–601 publications: 41 scientists 602–611 publications: 32 scientists 612–621 publications: 28 scientists 622–631 publications: 25 scientists 632–641 publications: 27 scientists 642–651 publications: 17 scientists 652–661 publications: 20 scientists 662–671 publications: 17 scientists 672–681 publications: 15 scientists 682–691 publications: 14 scientists 692–701 publications: 21 scientists 702–711 publications: 13 scientists 712–721 publications: 12 scientists 722–731 publications: 19 scientists 732–741 publications: 14 scientists 742–751 publications: 12 scientists 752–761 publications: 10 scientists 762–771 publications: 10 scientists 772–781 publications: 11 scientists 782–791 publications: 10 scientists 792–801 publications: 11 scientists 802–811 publications: 8 scientists 812–821 publications: 8 scientists 822–831 publications: 7 scientists 832–841 publications: 11 scientists 842–851 publications: 10 scientists 852–861 publications: 5 scientists 862–871 publications: 9 scientists 872–881 publications: 4 scientists 882–891 publications: 6 scientists 892–901 publications: 3 scientists 902–911 publications: 6 scientists 912–921 publications: 3 scientists 922–931 publications: 2 scientists 932–941 publications: 2 scientists 942–951 publications: 2 scientists 952–961 publications: 3 scientists 962–971 publications: 3 scientists 972–981 publications: 3 scientists 982–990 publications: 5 scientists 991+ publications: 100 scientists
32 publications 991+

This scientist: 468 publications — 92nd percentile

92% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 991 publications or more.

Christos H. Papadimitriou D-index placement in Computer Science in 2026

The chart shows the D-index (discipline H-index) distribution of Computer Science scientists ranked by Research.com in 2026. The highlighted bar marks where Christos H. Papadimitriou sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 983 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 968 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 763 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 518 scientists 54–55 D-Index: 500 scientists 56–57 D-Index: 458 scientists 58–59 D-Index: 400 scientists 60–61 D-Index: 337 scientists 62–63 D-Index: 308 scientists 64–65 D-Index: 292 scientists 66–67 D-Index: 249 scientists 68–69 D-Index: 213 scientists 70–71 D-Index: 192 scientists 72–73 D-Index: 189 scientists 74–75 D-Index: 165 scientists 76–77 D-Index: 139 scientists 78–79 D-Index: 119 scientists 80–81 D-Index: 121 scientists 82–83 D-Index: 113 scientists 84–85 D-Index: 88 scientists 86–87 D-Index: 87 scientists 88–89 D-Index: 75 scientists 90–91 D-Index: 69 scientists 92–93 D-Index: 57 scientists 94–95 D-Index: 46 scientists 96–97 D-Index: 38 scientists 98–99 D-Index: 34 scientists 100–101 D-Index: 36 scientists 102–103 D-Index: 27 scientists 104–105 D-Index: 37 scientists 106–107 D-Index: 18 scientists 108–109 D-Index: 31 scientists 110–111 D-Index: 19 scientists 112–113 D-Index: 16 scientists 114–115 D-Index: 12 scientists 116–117 D-Index: 20 scientists 118–119 D-Index: 15 scientists 120–121 D-Index: 5 scientists 122–123 D-Index: 20 scientists 124–125 D-Index: 8 scientists 126–127 D-Index: 5 scientists 128–129 D-Index: 7 scientists 130 D-Index: 3 scientists 131+ D-Index: 98 scientists
30 D-Index 131+

This scientist: 133 D-Index — 99th percentile

99% of scientists in this discipline score the same or lower.

The last bar groups every scientist with 131 D-Index or more.

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

  • Worst-case equilibria

    Elias Koutsoupias;Christos Papadimitriou

  • Optimization, approximation, and complexity classes

    Christos H. Papadimitriou;Mihalis Yannakakis

  • Elements of the Theory of Computation

    Harry R. Lewis;Christos H. Papadimitriou

  • The Complexity of Computing a Nash Equilibrium

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

  • The Complexity of Markov Decision Processes

    Christos H. Papadimitriou;John N. Tsitsiklis

  • Latent semantic indexing: a probabilistic analysis

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

  • Algorithms, games, and the internet

    Christos Papadimitriou

  • The serializability of concurrent database updates

    Christos H. Papadimitriou

  • Geographic routing without location information

    Ananth Rao;Sylvia Ratnasamy;Christos Papadimitriou;Scott Shenker

  • The Euclidean travelling salesman problem is NP-complete

    Christos H. Papadimitriou

  • On generating all maximal independent sets

    David S. Johnson;Christos H. Papadimitriou

  • How easy is local search

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

  • On the complexity of the parity argument and other inefficient proofs of existence

    Christos H. Papadimitriou

  • The discrete geodesic problem

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

  • The Complexity of Multiterminal Cuts

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

  • Shortest paths without a map

    Christos H. Papadimitriou;Mihalis Yannakakis

  • The complexity of pure Nash equilibria

    Alex Fabrikant;Christos Papadimitriou;Kunal Talwar

  • A simple algorithm for finding frequent elements in streams and bags

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

  • On the complexity of integer programming

    Christos H. Papadimitriou

  • Latent Semantic Indexing

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

Frequent Co-Authors

Mihalis Yannakakis
Mihalis Yannakakis Columbia University
Elias Koutsoupias
Elias Koutsoupias University of Oxford
Santosh Vempala
Santosh Vempala Georgia Institute of Technology
Xiaotie Deng
Xiaotie Deng Peking University
Richard M. Karp
Richard M. Karp University of California, Berkeley
Wolfgang Maass
Wolfgang Maass Graz University of Technology
Scott Shenker
Scott Shenker University of California, Berkeley
Prabhakar Raghavan
Prabhakar Raghavan Google (United States)
Phokion G. Kolaitis
Phokion G. Kolaitis University of California, Santa Cruz

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 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.

Best Scientists Citing Christos H. Papadimitriou

Trending Scientists

Recently Published Articles