What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Geometry
- Algebra
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 most cited work include:
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey (4497 citations)
- Concrete Mathematics: A Foundation for Computer Science (2067 citations)
- Bounds on Multiprocessing Timing Anomalies (1925 citations)
What are the main themes of his work throughout his whole career to date?
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.
He most often published in these fields:
- Combinatorics (62.08%)
- Discrete mathematics (37.68%)
- Ramsey theory (6.76%)
What were the highlights of his more recent work (between 2009-2021)?
- Combinatorics (62.08%)
- Discrete mathematics (37.68%)
- Art history (1.93%)
In recent papers he was focusing on the following fields of study:
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.
Between 2009 and 2021, his most popular works were:
- On the history of the Euclidean Steiner tree problem (49 citations)
- Magical Mathematics: The Mathematical Ideas That Animate Great Magic Tricks (34 citations)
- Edge flipping in graphs (22 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Geometry
- Algebra
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.
