World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
66
Citations
15493
World Ranking
2352
National Ranking
1171

Research.com Recognitions

  • 2015 - Member of the National Academy of Engineering For contributions to formation evaluation and development of pulsed nuclear magnetic resonance logging.
  • 2008 - Fellow of Alfred P. Sloan Foundation

Overview

Robert Kleinberg is affiliated with Cornell University in the United States. Their research focuses primarily on decision sciences and computer science, with significant contributions in management science and operations research, computer networks and communications, computational theory and mathematics, economics and econometrics, and marketing.

The main topics of their work include:

  • Auction Theory and Applications
  • Optimization and Search Problems
  • Consumer Market Behavior and Pricing
  • Game Theory and Applications
  • Advanced Bandit Algorithms Research
  • Interconnection Networks and Systems
  • Advanced Memory and Neural Computing

Kleinberg has published extensively, with a notable number of papers appearing in venues such as arXiv (Cornell University), Lecture Notes in Computer Science, Proceedings of the International AAAI Conference on Web and Social Media, Journal of Economic Theory, and ACM Transactions on Algorithms. Some of their recent papers include:

  • A Measure of Polarization on Social Media Networks Based on Community Boundaries, 2021, Proceedings of the International AAAI Conference on Web and Social Media
  • Full surplus extraction from samples, 2021, Journal of Economic Theory
  • Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem, 2021, ACM Transactions on Algorithms
  • Approximation Algorithms for the Bottleneck Asymmetric Traveling Salesman Problem, 2020, arXiv (Cornell University)
  • Individual Fairness in Prophet Inequalities, 2022, Proceedings of the 23rd ACM Conference on Economics and Computation

Frequently collaborating with other researchers, Kleinberg's co-authors include Princewill Okoroafor, Makis Arsenis, Tegan Wilson, Daniel Amir, and Vishal Shrivastav.

In recognition of achievements, Kleinberg is a member of the National Academy of Engineering since 2015 and was named a Fellow of the Alfred P. Sloan Foundation in 2008.

Best Publications

  • Learning diverse rankings with multi-armed bandits

    Filip Radlinski;Robert Kleinberg;Thorsten Joachims

  • The K-armed dueling bandits problem

    Yisong Yue;Josef Broder;Robert Kleinberg;Thorsten Joachims

  • Geographic Routing Using Hyperbolic Space

    R. Kleinberg

  • Multi-armed bandits in metric spaces

    Robert Kleinberg;Aleksandrs Slivkins;Eli Upfal

  • Bandits with Knapsacks

    Ashwinkumar Badanidiyuru;Robert Kleinberg;Aleksandrs Slivkins

  • Nearly Tight Bounds for the Continuum-Armed Bandit Problem

    Robert D. Kleinberg

  • The value of knowing a demand curve: bounds on regret for online posted-price auctions

    R. Kleinberg;T. Leighton

  • A multiple-choice secretary algorithm with applications to online auctions

    Robert Kleinberg

  • Continuous-time model of structural balance.

    Seth A. Marvel;Jon Kleinberg;Robert D. Kleinberg;Steven H. Strogatz

  • Algorithmic pricing via virtual valuations

    Shuchi Chawla;Jason D. Hartline;Robert Kleinberg

  • Regret bounds for sleeping experts and bandits

    Robert Kleinberg;Alexandru Niculescu-Mizil;Yogeshwer Sharma

  • Group-theoretic algorithms for matrix multiplication

    H. Cohn;R. Kleinberg;B. Szegedy;C. Umans

  • Matroids, secretary problems, and online mechanisms

    Moshe Babaioff;Nicole Immorlica;Robert Kleinberg

  • Adaptive routing with end-to-end feedback: distributed learning and geometric approaches

    Baruch Awerbuch;Robert D. Kleinberg

  • Network performance monitoring in a content delivery system

    F. Thomson Leighton;Rizwan S. Dhanidina;Robert D. Kleinberg;Matthew Levine

  • Adaptive limited-supply online auctions

    Mohammad Taghi Hajiaghayi;Robert Kleinberg;David C. Parkes

  • Matroid prophet inequalities

    Robert Kleinberg;Seth Matthew Weinberg

  • A Knapsack Secretary Problem with Applications

    Moshe Babaioff;Nicole Immorlica;David Kempe;Robert Kleinberg

  • Truthful Mechanisms with Implicit Payment Computation

    Moshe Babaioff;Robert D. Kleinberg;Aleksandrs Slivkins

  • An Alternative View: When Does SGD Escape Local Minima?

    Robert Kleinberg;Yuanzhi Li;Yang Yuan

  • Semi-Oblivious Traffic Engineering: The Road Not Taken.

    Praveen Kumar;Yang Yuan;Chris Yu;Nate Foster

  • Matroid Prophet Inequalities

    Robert Kleinberg;S. Matthew Weinberg

Frequent Co-Authors

Aleksandrs Slivkins
Aleksandrs Slivkins Microsoft (United States)
MohammadTaghi Hajiaghayi
MohammadTaghi Hajiaghayi University of Maryland, College Park
Jason D. Hartline
Jason D. Hartline Northwestern University
Jon Kleinberg
Jon Kleinberg Cornell University
Nicole Immorlica
Nicole Immorlica Microsoft (United States)
Éva Tardos
Éva Tardos Cornell University
Nate Foster
Nate Foster Cornell University
Christian Borgs
Christian Borgs University of California, Berkeley
Jennifer Chayes
Jennifer Chayes University of California, Berkeley

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 in the USA opens pathways to a wide variety of online degrees and flexible career options. If you’re eager to enter the workforce quickly, consider the quickest masters degree online programs. These accelerated degrees let you build specialized skills in less time, getting you job-ready faster.

For those weighing the value of further study, some graduate degrees that are worth it stand out in the tech industry. They not only boost earning potential but are also highly sought after by employers in fields like artificial intelligence, cybersecurity, and data science.

Not sure about starting with a four-year program? An online associate's degree can give you foundational skills in computer science, often at a significantly lower cost and commitment. This credential can also be a stepping stone toward higher degrees or entry-level tech roles.

Affordability matters too. With so many affordable online colleges, you can pursue your education without breaking the bank. This flexibility ensures that advancing your career in computer science is accessible, no matter your background.

Best Scientists Citing Robert Kleinberg

Trending Scientists