Ronald Graham
| Ronald Graham | |
|---|---|
Ronald Graham in 1998
|
|
| Born |
October 31, 1935 Taft, California |
| Fields | Combinatorics, information science, graph theory, scheduling theory |
| Institutions | Bell Labs, AT&T Labs |
| Alma mater | University of California, Berkeley |
| Doctoral advisor | Derrick Henry Lehmer |
Ronald Lewis "Ron" Graham (born October 31, 1935) is a mathematician credited by the American Mathematical Society as being "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He has done important work in scheduling theory, computational geometry, Ramsey theory, and quasi-randomness.
He is currently the Chief Scientist at the California Institute for Telecommunications and Information Technology (also known as Cal-(IT)2) and the Irwin and Joan Jacobs Professor in Computer Science and Engineering at the University of California, San Diego (UCSD).
Graham was born in Taft, California. In 1962, he received his Ph.D. in mathematics from the University of California, Berkeley and began working at Bell Labs and later AT&T Labs. He was director of information sciences in AT&T Labs, but retired from AT&T in 1999 after 37 years.
His 1977 paper considered a problem in Ramsey theory, and gave a "large number" as an upper bound for its solution. This number has since become well known as the largest number ever used in a mathematical proof (was listed as such in the Guinness Book of Records), and is now known as Graham's number, although it has since then been surpassed by even larger numbers such as TREE(3).
...
Wikipedia