World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
84
Citations
55799
World Ranking
822
National Ranking
446

Mathematics

D-Index
84
Citations
56125
World Ranking
108
National Ranking
60

Research.com Recognitions

  • 2013 - Fellow of the American Mathematical Society
  • 2003 - Steele Prize for Lifetime Achievement
  • 1999 - ACM Fellow For seminal contributions to the analysis of algorithms, in particular the worst-case analysis of heuristics, the theory of scheduling, and computational geometry.
  • 1985 - Member of the National Academy of Sciences
  • 1984 - Fellow of the American Association for the Advancement of Science (AAAS)
  • 1971 - George Pólya Prize

Overview

Ron Graham was affiliated with the University of California, San Diego in the United States. Their research primarily spanned the field of Computer Science, with particular focus on subfields such as Artificial Intelligence, Computational Theory and Mathematics, Economics and Econometrics, Computer Networks and Communications, and Statistics and Probability.

The scientist contributed to multiple main topics within their work, including:

  • Artificial Intelligence in Games
  • Sports Analytics and Performance
  • Algorithms and Data Compression
  • Random Matrices and Applications
  • Complexity and Algorithms in Graphs
  • Decision-Making and Behavioral Economics
  • Computability, Logic, AI Algorithms

Recent publications demonstrated a focus on combinatorics, probability, and scheduling, with notable works including:

  • Card guessing with partial feedback, 2021, Combinatorics Probability Computing
  • Guessing about Guessing: Practical Strategies for Card Guessing with Feedback, 2022, American Mathematical Monthly
  • Guessing about Guessing: Practical Strategies for Card Guessing with Feedback, 2020, arXiv (Cornell University)
  • On Levine's Notorious Hat Puzzle, 2021, arXiv (Cornell University)
  • Lower bounds for online scheduling on four processors, 2025, Journal of Scheduling

Frequent coauthors who collaborated with Ron Graham included:

  • Persi Diaconis
  • Sam Spiro
  • Xiaoyu He
  • Joe Buhler
  • Chris Freiling

Publishing venues where the scientist's work appeared include:

  • arXiv (Cornell University)
  • Combinatorics Probability Computing
  • American Mathematical Monthly
  • Journal of Scheduling

Their career was recognized through several awards and honors, including:

  • Fellow of the American Mathematical Society (2013)
  • Steele Prize for Lifetime Achievement (2003)
  • ACM Fellow (1999) for contributions to the analysis of algorithms, particularly in worst-case analysis of heuristics, scheduling theory, and computational geometry
  • Member of the National Academy of Sciences (1985)
  • Fellow of the American Association for the Advancement of Science (AAAS) (1984)
  • George Pólya Prize (1971)

Best Publications

  • Concrete Mathematics: A Foundation for Computer Science

    Ronald L. Graham;Donald E. Knuth;Oren Patashnik

  • Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

    R.L. Graham;E.L. Lawler;Jan Karel Lenstra;A.H.G. Rinnooy Kan

  • Bounds on Multiprocessing Timing Anomalies

    Ronald L. Graham

  • An efficient algorith for determining the convex hull of a finite planar set

    Ronald L. Graham

  • Bounds for certain multiprocessing anomalies

    R. L. Graham

  • Ramsey Theory

    Ronald L. Graham

  • Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

    David S. Johnson;Alan J. Demers;Jeffrey D. Ullman;M. R. Garey

  • On the History of the Minimum Spanning Tree Problem

    R.L. Graham;Pavol Hell

  • Handbook of Combinatorics

    Ronald L. Graham;Martin Grötschel;László Lovász

  • Optimal scheduling for two-processor systems

    E. G. Coffman;R. L. Graham

  • Spearman's Footrule as a Measure of Disarray

    Persi Diaconis;R. L. Graham

  • Concrete Mathematics: A Foundation for Computer Science.

    Edward A. Bender;Ronald Lewis Graham;Donald Ervin Knuth;Oren Patashnik

  • The Complexity of Computing Steiner Minimal Trees

    M. R. Garey;R. L. Graham;D. S. Johnson

  • On the addressing problem for loop switching

    R. L. Graham;H. O. Pollak

  • Quasi-random graphs

    Fan R. K. Chung;Ronald L. Graham;Richard M. Wilson

  • The steiner problem in phylogeny is NP-complete

    L. R. Foulds;R. L. Graham

  • Old and new problems and results in combinatorial number theory

    Paul Erdős;Ronald L. Graham

  • On Additive Bases and Harmonious Graphs

    Ronald L. Graham;Neil J. A. Sloane

  • Some NP-complete geometric problems

    M. R. Garey;R. L. Graham;D. S. Johnson

  • Resource constrained scheduling as generalized bin packing

    M. R. Garey;Ronald L. Graham;David S. Johnson;Andrew Chi-Chih Yao

Frequent Co-Authors

Fan Chung
Fan Chung University of California, San Diego
Persi Diaconis
Persi Diaconis Stanford University
Chung-Kuan Cheng
Chung-Kuan Cheng University of California, San Diego
Michael Randolph Garey
Michael Randolph Garey Nokia (United States)
Paul Erdös
Paul Erdös Hungarian Academy of Sciences
Peter Frankl
Peter Frankl Alfréd Rényi Institute of Mathematics
Joel Spencer
Joel Spencer Courant Institute of Mathematical Sciences
Ding-Zhu Du
Ding-Zhu Du The University of Texas at Dallas
Frances F. Yao
Frances F. Yao City University of Hong Kong
Andrew Chi-Chih Yao
Andrew Chi-Chih Yao Tsinghua University

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

For students pursuing Mathematics in the USA, expanding skill sets through related online degrees can enhance career prospects. Many graduates explore advanced programs to complement their analytical abilities.

One popular option is a marketing masters, which helps develop data-driven marketing strategies, bridging quantitative skills and business insights.

Business-focused professionals may benefit from enrolling in the best 1 year mba programs to gain leadership skills quickly and effectively without a long-term commitment.

Many students also seek flexibility through mba programs that accept transfer credits, allowing them to leverage prior coursework and accelerate their education.

Additionally, a master in data analytics offers specialized training in handling big data and predictive modeling, highly complementary to a Mathematics background.

Choosing the right program depends on your career goals and how you want to apply mathematical skills in business, marketing, or data-centric fields.

Best Scientists Citing Ron Graham

Recently Published Articles