World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
62
Citations
18361
World Ranking
2860
National Ranking
1413

Vahab Mirrokni 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 Vahab Mirrokni 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: 349 publications — 82nd percentile

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

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

Vahab Mirrokni 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 Vahab Mirrokni 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: 62 D-Index — 80th percentile

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

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

Overview

Vahab Mirrokni is affiliated with Google in the United States and has an extensive research portfolio primarily in the field of Computer Science. Their work spans multiple subfields, including Artificial Intelligence, Management Science and Operations Research, Computer Networks and Communications, Statistics and Probability, and Marketing.

The scientist has contributed significantly to research topics such as:

  • Auction Theory and Applications
  • Advanced Bandit Algorithms Research
  • Consumer Market Behavior and Pricing
  • Privacy-Preserving Technologies in Data
  • Data Management and Algorithms
  • Optimization and Search Problems
  • Stochastic Gradient Optimization Techniques

Key recent publications include:

  • "Large-Scale Community Detection on YouTube for Topic Discovery and Exploration," 2021, Proceedings of the International AAAI Conference on Web and Social Media
  • "Product Ranking on Online Platforms," 2022, Management Science
  • "The Best of Many Worlds: Dual Mirror Descent for Online Allocation Problems," 2022, Operations Research
  • "Budget-Management Strategies in Repeated Auctions," 2021, Operations Research
  • "Fair Resource Allocation in a Volatile Marketplace," 2021, Operations Research

Frequent publication venues include:

  • arXiv (Cornell University)
  • Operations Research
  • SSRN Electronic Journal
  • Proceedings of the VLDB Endowment
  • Proceedings of the AAAI Conference on Artificial Intelligence

Mirrokni often collaborates with several co-authors, including:

  • Hossein Esfandiari
  • Santiago Balseiro
  • Peilin Zhong
  • Song Zuo
  • Alessandro Epasto

Best Publications

  • Locality-sensitive hashing scheme based on p-stable distributions

    Mayur Datar;Nicole Immorlica;Piotr Indyk;Vahab S. Mirrokni

  • Maximizing Non-monotone Submodular Functions

    Uriel Feige;Vahab S. Mirrokni;Jan Vondrák

  • Optimal marketing strategies over social networks

    Jason Hartline;Vahab Mirrokni;Mukund Sundararajan

  • Power optimization in fault-tolerant topology control algorithms for wireless multi-hop networks

    Mohammad Taghi Hajiaghayi;Nicole Immorlica;Vahab S. Mirrokni

  • Online Stochastic Matching: Beating 1-1/e

    Jon Feldman;Aranyak Mehta;Vahab Mirrokni;S. Muthukrishnan

  • Market sharing games applied to content distribution in ad hoc networks

    M.X. Goemans;Li Li;V.S. Mirrokni;M. Thottan

  • Maximizing Non-Monotone Submodular Functions

    U. Feigc;V.S. Mirrokni;J. Vondrak

  • Tight approximation algorithms for maximum general assignment problems

    Lisa Fleischer;Michel X. Goemans;Vahab S. Mirrokni;Maxim Sviridenko

  • Limitations of cross-monotonic cost-sharing schemes

    Nicole Immorlica;Mohammad Mahdian;Vahab S. Mirrokni

  • Non-monotone submodular maximization under matroid and knapsack constraints

    Jon Lee;Vahab S. Mirrokni;Viswanath Nagarajan;Maxim Sviridenko

  • Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks

    Mohsen Bahramgiri;Mohammadtaghi Hajiaghayi;Vahab S. Mirrokni

  • Trust-based recommendation systems: an axiomatic approach

    Reid Andersen;Christian Borgs;Jennifer Chayes;Uriel Feige

  • Online stochastic packing applied to display ad allocation

    Jon Feldman;Monika Henzinger;Nitish Korula;Vahab S. Mirrokni

  • Sink equilibria and convergence

    M. Goemans;Vahab Mirrokni;A. Vetta

  • Yield Optimization of Display Advertising with Ad Exchange

    Santiago R. Balseiro;Jon Feldman;Vahab Mirrokni;Shan Muthukrishnan

  • Online Ad Assignment with Free Disposal

    Jon Feldman;Nitish Korula;Vahab Mirrokni;S. Muthukrishnan

  • Non-monotone submodular maximization under matroid and knapsack constraints

    Jon Lee;Vahab Mirrokni;Viswanath Nagarjan;Maxim Sviridenko

  • On spectrum sharing games

    Magnús M. Halldórsson;Joseph Y. Halpern;Li Erran Li;Vahab S. Mirrokni

  • Fault-tolerant and 3-dimensional distributed topology control algorithms in wireless multi-hop networks

    M. Bahramgiri;M. Hajlaghayi;V.S. Mirrokni

  • Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints

    Jon Lee;Vahab S. Mirrokni;Viswanath Nagarajan;Maxim Sviridenko

  • Stochastic bandits robust to adversarial corruptions

    Thodoris Lykouris;Vahab Mirrokni;Renato Paes Leme

  • Tight Approximation Algorithms for Maximum Separable Assignment Problems

    Lisa Fleischer;Michel X. Goemans;Vahab S. Mirrokni;Maxim Sviridenko

Frequent Co-Authors

Nicole Immorlica
Nicole Immorlica Microsoft (United States)
Jon Feldman
Jon Feldman Google (United States)
MohammadTaghi Hajiaghayi
MohammadTaghi Hajiaghayi University of Maryland, College Park
Subbaratnam Muthukrishnan
Subbaratnam Muthukrishnan Kansas State University
Christian Borgs
Christian Borgs University of California, Berkeley
Jennifer Chayes
Jennifer Chayes University of California, Berkeley
Mohammad Mahdian
Mohammad Mahdian Google (United States)
Guy Kortsarz
Guy Kortsarz Rutgers, The State University of New Jersey
Shang-Hua Teng
Shang-Hua Teng University of Southern California

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

As the demand for skilled tech professionals grows, students studying Computer Science in the USA may want to consider related online degrees to expand their career opportunities. Specializing in areas such as data science, engineering, or physics can open doors in diverse industries, including artificial intelligence, robotics, and renewable energy.

If you're interested in engineering, you can explore the cheapest online master's mechanical engineering programs. Similarly, for those seeking flexibility and affordability in physical sciences, the cheapest online physics degree options may be ideal.

Data-driven careers are expanding rapidly. Earning a recognized data science degree online can provide key analytical skills and access to high-demand jobs. Aspiring engineers may also consider the online bachelor’s in electrical engineering to gain foundational knowledge relevant to many tech sectors.

Exploring these related pathways helps future computer scientists build diverse skills and remain competitive in the evolving tech landscape.

Best Scientists Citing Vahab Mirrokni

Trending Scientists

Recently Published Articles