World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
75
Citations
44584
World Ranking
1371
National Ranking
714

Éva Tardos 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 Éva Tardos 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: 250 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: 560 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: 424 scientists 242–251 publications: 408 scientists 252–261 publications: 378 scientists 262–271 publications: 300 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: 220 publications — 53rd percentile

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

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

Éva Tardos 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 Éva Tardos sits on this spectrum.

30–31 D-Index: 879 scientists 32–33 D-Index: 984 scientists 34–35 D-Index: 918 scientists 36–37 D-Index: 990 scientists 38–39 D-Index: 969 scientists 40–41 D-Index: 907 scientists 42–43 D-Index: 821 scientists 44–45 D-Index: 765 scientists 46–47 D-Index: 689 scientists 48–49 D-Index: 543 scientists 50–51 D-Index: 543 scientists 52–53 D-Index: 517 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: 75 D-Index — 90th percentile

90% 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

  • 2019 - IEEE John von Neumann Medal “For contributions to the field of algorithms, including foundational new methods in optimization, approximation algorithms, and algorithmic game theory.”
  • 2013 - Fellow of the American Mathematical Society
  • 2013 - Member of the National Academy of Sciences
  • 2009 - SIAM Fellow For the design and analysis of graph and network algorithms.
  • 2007 - Member of the National Academy of Engineering For contributions to the design and analysis of efficient algorithms for network problems.
  • 2006 - Dantzig Prize, by the Society for Industrial and Applied Mathematics (SIAM) and the Mathematical Optimization Society (MOS)
  • 2005 - Fellow of the Institute for Operations Research and the Management Sciences (INFORMS)
  • 2001 - Fellow of the American Academy of Arts and Sciences
  • 1999 - Fellow of John Simon Guggenheim Memorial Foundation
  • 1998 - ACM Fellow For fundamental contributions in the design and analysis of algorithms, combinatorial optimization, network flows, and approximation algorithms.
  • 1991 - Fellow of Alfred P. Sloan Foundation

Overview

Éva Tardos is affiliated with Cornell University in the United States and has contributed extensively to algorithmic research, particularly in decision sciences and computer science. Their work spans various subfields including management science and operations research, economics and econometrics, computer networks and communications, information systems, and safety research.

Tardos's primary research topics include:

  • Auction Theory and Applications
  • Advanced Bandit Algorithms Research
  • Optimization and Search Problems
  • Economic theories and models
  • Experimental Behavioral Economics Studies
  • Game Theory and Applications
  • Game Theory and Voting Systems

Frequent coauthors collaborating with Tardos include Giannis Fikioris, Siddhartha Banerjee, Jon Kleinberg, Emily Ryu, and Yoav Kolumbus.

Their publications are commonly found in several notable venues, such as:

  • arXiv (Cornell University)
  • Journal of the ACM
  • Mathematics of Operations Research
  • ACM Transactions on Economics and Computation
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Representative recent papers include:

  • No-Regret Learning in Bayesian Games (2025), arXiv (Cornell University)
  • Simple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations (2021), ACM Transactions on Economics and Computation
  • Ordered Submodularity and its Applications to Diversifying Recommendations (2022), arXiv (Cornell University)
  • Liquid Welfare Guarantees for No-Regret Learning in Sequential Budgeted Auctions (2022), arXiv (Cornell University)
  • The Price of Anarchy of Strategic Queuing Systems (2023), Journal of the ACM

Tardos has been recognized with various honors throughout their career, including:

  • IEEE John von Neumann Medal (2019) for contributions to algorithms, optimization, approximation algorithms, and algorithmic game theory
  • Fellow of the American Mathematical Society (2013)
  • Member of the National Academy of Sciences (2013)
  • SIAM Fellow (2009) for the design and analysis of graph and network algorithms
  • Member of the National Academy of Engineering (2007) for contributions to efficient algorithms for network problems
  • Dantzig Prize by SIAM and the Mathematical Optimization Society (2006)
  • Fellow of the Institute for Operations Research and the Management Sciences (INFORMS) (2005)
  • Fellow of the American Academy of Arts and Sciences (2001)
  • Fellow of John Simon Guggenheim Memorial Foundation (1999)
  • ACM Fellow (1998) for contributions in algorithms, combinatorial optimization, and network flows
  • Fellow of Alfred P. Sloan Foundation (1991)

Best Publications

  • Maximizing the Spread of Influence through a Social Network

    David Kempe;Jon M. Kleinberg;Éva Tardos

  • How bad is selfish routing

    Tim Roughgarden;Éva Tardos

  • Algorithm Design

    Jon Kleinberg;Eva Tardos

  • Algorithmic Game Theory: Quantifying the Inefficiency of Equilibria

    Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani

  • Algorithmic Game Theory: Computing in Games

    Noam Nisan;Tim Roughgarden;Eva Tardos;Vijay V. Vazirani

  • The Price of Stability for Network Design with Fair Cost Allocation

    Elliot Anshelevich;Anirban Dasgupta;Jon Kleinberg;Éva Tardos

  • Approximation algorithms for scheduling unrelated parallel machines

    J. K. Lenstra;D. B. Shmoys;É. Tardos

  • Influential nodes in a diffusion model for social networks

    David Kempe;Jon Kleinberg;Éva Tardos

  • An approximation algorithm for the generalized assignment problem

    David B. Shmoys;Éva Tardos

  • Fast approximation algorithms for fractional packing and covering problems

    Serge A. Plotkin;David B. Shmoys;Éva Tardos

  • A constant-factor approximation algorithm for the k -median problem

    Moses Charikar;Sudipto Guha;Éva Tardos;David B. Shmoys

  • Approximation algorithms for facility location problems

    D.B. Shmoys;É. Tardos;K.I. Aardal

  • Truthful mechanisms for one-parameter agents

    A. Archer;E. Tardos

  • Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields

    Jon Kleinberg;Éva Tardos

  • Approximation algorithms for facility location problems (extended abstract)

    David B. Shmoys;Éva Tardos;Karen Aardal

  • A strongly polynomial algorithm to solve combinatorial linear programs

    Eva Tardos

  • Fairness in Routing and Load Balancing

    Jon Kleinberg;Yuval Rabani;Éva Tardos

  • An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents

    Aaron Archer;Christos H. Papadimitriou;Kunal Talwar;Éva Tardos

  • Frugal path mechanisms

    Aaron Archer;Éva Tardos

  • A strongly polynomial minimum cost circulation algorithm

    Éva Tardos

  • A constant-factor approximation algorithm for the k-median problem (extended abstract)

    Moses Charikar;Sudipto Guha;Éva Tardos;David B. Shmoys

Frequent Co-Authors

Jon Kleinberg
Jon Kleinberg Cornell University
Tim Roughgarden
Tim Roughgarden Columbia University
Serge Plotkin
Serge Plotkin Stanford University
David B. Shmoys
David B. Shmoys Cornell University
Robert Kleinberg
Robert Kleinberg Cornell University
Vijay V. Vazirani
Vijay V. Vazirani University of California, Irvine
Andrew V. Goldberg
Andrew V. Goldberg Amazon (United States)
Noam Nisan
Noam Nisan Hebrew University of Jerusalem
David Kempe
David Kempe University of Southern California
Yuval Rabani
Yuval Rabani Hebrew University of Jerusalem

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 can open up flexible pathways for students pursuing Computer Science and related careers. Many learners consider affordability a top concern, especially when comparing programs across universities.

For those seeking quality education at the best price, there are cheap online universities that offer accredited bachelor’s degrees, including in technical fields. If your interests extend to engineering, you’ll find some of the cheapest online engineering degree programs that make career advancement more accessible and budget-friendly.

Professionals aiming for leadership roles may look into affordable online executive mba programs which can broaden management skills beyond technical expertise. Additionally, those interested in intersecting technology with information management might explore the mlis degree online cost to determine affordable pathways in library and information science.

No matter your chosen direction, evaluating academic options with consideration for tuition, flexibility, and career outcomes ensures you invest wisely in your future.

Best Scientists Citing Éva Tardos

Trending Scientists

Recently Published Articles