World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

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

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