2023 - Research.com Mathematics in United States Leader Award
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
Ron Graham spends much of his time researching Combinatorics, Discrete mathematics, Mathematical optimization, Steiner tree problem and Multiprocessing. His study deals with a combination of Combinatorics and Quasi random. His research investigates the connection between Discrete mathematics and topics such as Binary code that intersect with issues in Hamming distance, Probability distribution and Direct sum.
His study in Mathematical optimization is interdisciplinary in nature, drawing from both Rate-monotonic scheduling, Dynamic priority scheduling, Two-level scheduling and Fair-share scheduling. The study incorporates disciplines such as Single-machine scheduling, Job shop scheduling, Model of computation, Theory of computation and Open shop in addition to Rate-monotonic scheduling. His Parallel computing research is multidisciplinary, incorporating elements of Worst case ratio and List scheduling.
His primary scientific interests are in Combinatorics, Discrete mathematics, Ramsey theory, Sequence and Algorithm. Combinatorics is closely attributed to Upper and lower bounds in his research. As part of his studies on Discrete mathematics, he often connects relevant subjects like Graph theory.
His work in Ramsey theory is not limited to one particular discipline; it also encompasses Ramsey's theorem.
Ron Graham focuses on Combinatorics, Discrete mathematics, Art history, Bounded function and Permutation. His Combinatorics research is multidisciplinary, incorporating perspectives in Characterization, Sequence and If and only if. Ron Graham interconnects Order, Algebraic number and Interpretation in the investigation of issues within Sequence.
His If and only if research incorporates elements of Hypercube and Hat puzzle. His work in the fields of Discrete mathematics, such as Real number and Ramsey theory, overlaps with other areas such as Monochromatic color. He combines subjects such as Fixed point and Joint probability distribution with his study of Permutation.
His main research concerns Combinatorics, Discrete mathematics, Algorithm, Bounded function and Art history. His primary area of study in Combinatorics is in the field of Permutation. His Discrete mathematics research integrates issues from Sample size determination and If and only if.
His biological study deals with issues like List scheduling, which deal with fields such as The Intersect, Job shop scheduling and Case analysis. His Bounded function research is multidisciplinary, relying on both Normalization and Greedy algorithm. His work on Magic as part of general Art history research is frequently linked to Magic, bridging the gap between disciplines.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
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.
Annals of discrete mathematics (1979)
Bounds on Multiprocessing Timing Anomalies
Ronald L. Graham.
Siam Journal on Applied Mathematics (1969)
An efficient algorith for determining the convex hull of a finite planar set
Ronald L. Graham.
Information Processing Letters (1972)
Bounds for certain multiprocessing anomalies
R. L. Graham.
Bell System Technical Journal (1966)
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.
SIAM Journal on Computing (1974)
On the History of the Minimum Spanning Tree Problem
R.L. Graham;Pavol Hell.
IEEE Annals of the History of Computing (1985)
Optimal scheduling for two-processor systems
E. G. Coffman;R. L. Graham.
Acta Informatica (1972)
Handbook of Combinatorics
Ronald L. Graham;Martin Grötschel;László Lovász.
If you think any of the details on this page are incorrect, let us know.
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: