Graham, Ronald L. 1935
Overview
Works:  176 works in 601 publications in 4 languages and 8,807 library holdings 

Genres:  Conference papers and proceedings Handbooks and manuals Documentary films Biography Biographical films Nonfiction films Film adaptations 
Roles:  Author, Editor, Director, Other, Interviewee 
Classifications:  QA39.2, 510 
Publication Timeline
.
Most widely held works about
Ronald L Graham
 On a number theoretic conjecture of Graham by William WingCheung Wong( )
 Graham, Ronald Lewis : mathematics( )
Most widely held works by
Ronald L Graham
Concrete mathematics : a foundation for computer science by
Ronald L Graham(
Book
)
96 editions published between 1988 and 2014 in English and Undetermined and held by 1,846 WorldCat member libraries worldwide
Abstract: "This is a list of all corrections made to the first printing (August 1988) of CONCRETE MATHEMATICS by Graham, Knuth, and Patashnik. The second printing (December 1988) incorporated these changes."
96 editions published between 1988 and 2014 in English and Undetermined and held by 1,846 WorldCat member libraries worldwide
Abstract: "This is a list of all corrections made to the first printing (August 1988) of CONCRETE MATHEMATICS by Graham, Knuth, and Patashnik. The second printing (December 1988) incorporated these changes."
Ramsey theory by
Ronald L Graham(
Book
)
28 editions published between 1980 and 2013 in English and Undetermined and held by 1,017 WorldCat member libraries worldwide
"Discrete mathematics, the study of finite structures, is one of the fastestgrowing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the everincreasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms."Book cover
28 editions published between 1980 and 2013 in English and Undetermined and held by 1,017 WorldCat member libraries worldwide
"Discrete mathematics, the study of finite structures, is one of the fastestgrowing areas in mathematics. The wide applicability of its evolving techniques points to the rapidity with which the field is moving from its beginnings to its maturity, and reflects the everincreasing interaction between discrete mathematics and computer science. This Series provides broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, and the analysis of algorithms."Book cover
Handbook of combinatorics by
Ronald L Graham(
Book
)
16 editions published in 1995 in English and Italian and held by 535 WorldCat member libraries worldwide
16 editions published in 1995 in English and Italian and held by 535 WorldCat member libraries worldwide
Rudiments of Ramsey theory by
Ronald L Graham(
Book
)
28 editions published between 1980 and 2015 in English and Russian and held by 509 WorldCat member libraries worldwide
28 editions published between 1980 and 2015 in English and Russian and held by 509 WorldCat member libraries worldwide
Erdős on graphs : his legacy of unsolved problems by
Fan R. K Chung(
Book
)
12 editions published between 1998 and 1999 in English and held by 449 WorldCat member libraries worldwide
12 editions published between 1998 and 1999 in English and held by 449 WorldCat member libraries worldwide
N is a number a portrait of Paul Erdős by
George Paul Csicsery(
Visual
)
3 editions published between 2004 and 2014 in English and held by 262 WorldCat member libraries worldwide
A man with no home and no job, Paul Erdos was the most prolific mathematician who ever lived. Born in Hungary in 1913, Erdos wrote and coauthored over 1,500 papers and pioneered several fields in theoretical mathematics. At the age of 83 he still spent most of his time on the road, going from math meeting to math meeting, continually working on problems. He died on September 20, 1996 while attending such a meeting in Warsaw, Poland. N is a number: a portrait of Paul Erdos was filmed between 1988 and 1991. The film opens at Cambridge University's 1991 honorary doctorate ceremony, where Erdos received an award he says he would gladly trade for a "nice new proof." For Erdos, the meaning of life is "to prove and conjecture. "In an age dominated by technical wizardry and high tech communications, Erdos was an unusual human link connecting hundreds of people. As he traveled from country to country, Erdos carried with him the latest in mathematical thinking, inspiring others to develop new ideas and, sometimes, entire new fields. In turn, the mathematical community supported this repository of centuries of mathematical knowledge and lore. Every mathematician in the world has an "Erdos Number"the number of people he or she is removed from having coauthored a paper with Erdos. To pursue this life of wandering and pure scholarship, Erdos relied on a network of other renowned mathematiciansall of whom regarded him as an international treasure. Wherever he touched down, whether in Hungary, Australia or Kalamazoo, Erdos immediately began working on problems with his colleagues. They, in turn, took care of his everyday needs. Ronald Graham, director of the Mathematical Sciences Research Center at ATandT Laboratories, keeps an "Erdos Room" at his home in New Jersey. From here, Graham managed Erdos's financial affairs and coordinated his travels and lectures, trying to maintain a semblance of order in the life of a man who kept no bank accounts and gave money to anyone he felt needed it. In Cambridge, England, Bela Bollobas, an exErdos student, provided another oasis. As the film progresses it becomes clear that mathematicians around the world had more than a professional stake in caring for Erdos. In different ways, each of the many prominent mathematicians in the film expresses dedication to and love for Erdos. The structure of N is a Number is based on Erdos's 50 years of perpetual wandering, "like a bumblebee," carrying news and mathematical information from university to university. Erdos established himself as a serious mathematician at the age of 20 when he devised a more elegant proof for Chebyshev's theorem, i. e. , that there is always a prime number between any number and its double. He was at the center of an informal clique of gifted young mathematicians in Hungary, known as the Anonymous Group, because they would meet in a Budapest park under the statue of a medieval historian named Anonymous
3 editions published between 2004 and 2014 in English and held by 262 WorldCat member libraries worldwide
A man with no home and no job, Paul Erdos was the most prolific mathematician who ever lived. Born in Hungary in 1913, Erdos wrote and coauthored over 1,500 papers and pioneered several fields in theoretical mathematics. At the age of 83 he still spent most of his time on the road, going from math meeting to math meeting, continually working on problems. He died on September 20, 1996 while attending such a meeting in Warsaw, Poland. N is a number: a portrait of Paul Erdos was filmed between 1988 and 1991. The film opens at Cambridge University's 1991 honorary doctorate ceremony, where Erdos received an award he says he would gladly trade for a "nice new proof." For Erdos, the meaning of life is "to prove and conjecture. "In an age dominated by technical wizardry and high tech communications, Erdos was an unusual human link connecting hundreds of people. As he traveled from country to country, Erdos carried with him the latest in mathematical thinking, inspiring others to develop new ideas and, sometimes, entire new fields. In turn, the mathematical community supported this repository of centuries of mathematical knowledge and lore. Every mathematician in the world has an "Erdos Number"the number of people he or she is removed from having coauthored a paper with Erdos. To pursue this life of wandering and pure scholarship, Erdos relied on a network of other renowned mathematiciansall of whom regarded him as an international treasure. Wherever he touched down, whether in Hungary, Australia or Kalamazoo, Erdos immediately began working on problems with his colleagues. They, in turn, took care of his everyday needs. Ronald Graham, director of the Mathematical Sciences Research Center at ATandT Laboratories, keeps an "Erdos Room" at his home in New Jersey. From here, Graham managed Erdos's financial affairs and coordinated his travels and lectures, trying to maintain a semblance of order in the life of a man who kept no bank accounts and gave money to anyone he felt needed it. In Cambridge, England, Bela Bollobas, an exErdos student, provided another oasis. As the film progresses it becomes clear that mathematicians around the world had more than a professional stake in caring for Erdos. In different ways, each of the many prominent mathematicians in the film expresses dedication to and love for Erdos. The structure of N is a Number is based on Erdos's 50 years of perpetual wandering, "like a bumblebee," carrying news and mathematical information from university to university. Erdos established himself as a serious mathematician at the age of 20 when he devised a more elegant proof for Chebyshev's theorem, i. e. , that there is always a prime number between any number and its double. He was at the center of an informal clique of gifted young mathematicians in Hungary, known as the Anonymous Group, because they would meet in a Budapest park under the statue of a medieval historian named Anonymous
Combinatorial mathematics : proceedings of the Third International Conference by
International Conference on Combinatorial Mathematics(
Book
)
13 editions published in 1989 in English and held by 259 WorldCat member libraries worldwide
13 editions published in 1989 in English and held by 259 WorldCat member libraries worldwide
Old and new problems and results in combinatorial number theory by
Paul Erdős(
Book
)
11 editions published in 1980 in English and Undetermined and held by 221 WorldCat member libraries worldwide
11 editions published in 1980 in English and Undetermined and held by 221 WorldCat member libraries worldwide
Contemporary trends in discrete mathematics : from DIMACS and DIMATIA to the future : DIMATIADIMACS conference, May 1925,
1997, Štiřín Castle, Czech Republic by DIMATIADIMACS conference(
Book
)
15 editions published between 1997 and 2000 in English and held by 154 WorldCat member libraries worldwide
15 editions published between 1997 and 2000 in English and held by 154 WorldCat member libraries worldwide
Mathématiques concrètes : fondations pour l'informatique by
Ronald L Graham(
Book
)
7 editions published between 1997 and 2003 in French and held by 131 WorldCat member libraries worldwide
7 editions published between 1997 and 2003 in French and held by 131 WorldCat member libraries worldwide
Handbook of combinatorics(
Book
)
11 editions published in 1995 in English and held by 105 WorldCat member libraries worldwide
11 editions published in 1995 in English and held by 105 WorldCat member libraries worldwide
Handbook of combinatorics(
Book
)
11 editions published between 1995 and 2006 in English and held by 88 WorldCat member libraries worldwide
11 editions published between 1995 and 2006 in English and held by 88 WorldCat member libraries worldwide
The shortest network problem by
Ronald L Graham(
Visual
)
3 editions published between 1988 and 1989 in English and held by 71 WorldCat member libraries worldwide
Dr. Graham's lecture explores the Steiner problem which asks for the shortest network of line segments to interconnect a set of given points in the design of highway systems, oil pipelines, air conditioning systems and integrated circuits on silicon chips. Provides an introduction to NPcompleteness, a fundamental concept in theoretical computer science
3 editions published between 1988 and 1989 in English and held by 71 WorldCat member libraries worldwide
Dr. Graham's lecture explores the Steiner problem which asks for the shortest network of line segments to interconnect a set of given points in the design of highway systems, oil pipelines, air conditioning systems and integrated circuits on silicon chips. Provides an introduction to NPcompleteness, a fundamental concept in theoretical computer science
Combinatorial number theory : proceedings of the "Integers Conference 2005" in celebration of the 70th birthday of Ronald
Graham, Carrollton, Georgia, USA, October 2730, 2005 by
Bruce M Landman(
Book
)
5 editions published in 2007 in English and held by 70 WorldCat member libraries worldwide
This volume contains refereed papers related to the lectures given at a conference in number theory, the?Integers Conference 2007?, which was held at the University of West Georgia in October 2007, with many distinguished speakers including Neil Hindman, Melvyn Nathanson, Richard Nowakowski, Carl Pomerance, and many others
5 editions published in 2007 in English and held by 70 WorldCat member libraries worldwide
This volume contains refereed papers related to the lectures given at a conference in number theory, the?Integers Conference 2007?, which was held at the University of West Georgia in October 2007, with many distinguished speakers including Neil Hindman, Melvyn Nathanson, Richard Nowakowski, Carl Pomerance, and many others
Solving ordinary differential equations by
E Hairer(
Book
)
1 edition published in 1993 in English and held by 51 WorldCat member libraries worldwide
The subject of this book is the solution of stiff differential equations and of differentialalgebraic systems (differential equations with constraints). There is a chapter on onestep and extrapolation methods for stiff problems, another on multistep methods and general linear methods for stiff problems, a third on the treatment of singular perturbation problems, and a last one on differentialalgebraic problems with applications to constrained mechanical systems. The beginning of each chapter is of introductory nature, followed by practical applications, the discussion of numerical results, theoretical investigations on the order and accuracy, linear and nonlinear stability, convergence and asymptotic expansions. Stiff and differentialalgebraic problems arise everywhere in scientific computations (e.g. in physics, chemistry, biology, control engineering, electrical network analysis, mechanical systems). Many applications as well as computer programs are presented. Ernst Hairer and Gerhard Wanner were jointly awarded the 2003 Peter Henrici Prize at ICIAM 2003 in Sydney, Australia
1 edition published in 1993 in English and held by 51 WorldCat member libraries worldwide
The subject of this book is the solution of stiff differential equations and of differentialalgebraic systems (differential equations with constraints). There is a chapter on onestep and extrapolation methods for stiff problems, another on multistep methods and general linear methods for stiff problems, a third on the treatment of singular perturbation problems, and a last one on differentialalgebraic problems with applications to constrained mechanical systems. The beginning of each chapter is of introductory nature, followed by practical applications, the discussion of numerical results, theoretical investigations on the order and accuracy, linear and nonlinear stability, convergence and asymptotic expansions. Stiff and differentialalgebraic problems arise everywhere in scientific computations (e.g. in physics, chemistry, biology, control engineering, electrical network analysis, mechanical systems). Many applications as well as computer programs are presented. Ernst Hairer and Gerhard Wanner were jointly awarded the 2003 Peter Henrici Prize at ICIAM 2003 in Sydney, Australia
Magical mathematics : the mathematical ideas that animate great magic tricks by
Persi Diaconis(
Book
)
11 editions published between 2011 and 2016 in English and held by 46 WorldCat member libraries worldwide
"Magical Mathematics reveals the secrets of amazing, funtoperform card tricksand the profound mathematical ideas behind themthat will astound even the most accomplished magician. Persi Diaconis and Ron Graham provide easy, stepbystep instructions for each trick, explaining how to set up the effect and offering tips on what to say and do while performing it. Each card trick introduces a new mathematical idea, and varying the tricks in turn takes readers to the very threshold of today's mathematical knowledge. For example, the Gilbreath principlea fantastic effect where the cards remain in control despite being shuffledis found to share an intimate connection with the Mandelbrot set. Other card tricks link to the mathematical secrets of combinatorics, graph theory, number theory, topology, the Riemann hypothesis, and even Fermat's last theorem. Diaconis and Graham are mathematicians as well as skilled performers with decades of professional experience between them. In this book they share a wealth of conjuring lore, including some closely guarded secrets of legendary magicians. Magical Mathematics covers the mathematics of juggling and shows how the I Ching connects to the history of probability and magic tricks both old and new. It tells the storiesand reveals the best tricksof the eccentric and brilliant inventors of mathematical magic. Magical Mathematics exposes old gambling secrets through the mathematics of shuffling cards, explains the classic streetgambling scam of threecard monte, traces the history of mathematical magic back to the thirteenth century and the oldest mathematical trickand much more"
11 editions published between 2011 and 2016 in English and held by 46 WorldCat member libraries worldwide
"Magical Mathematics reveals the secrets of amazing, funtoperform card tricksand the profound mathematical ideas behind themthat will astound even the most accomplished magician. Persi Diaconis and Ron Graham provide easy, stepbystep instructions for each trick, explaining how to set up the effect and offering tips on what to say and do while performing it. Each card trick introduces a new mathematical idea, and varying the tricks in turn takes readers to the very threshold of today's mathematical knowledge. For example, the Gilbreath principlea fantastic effect where the cards remain in control despite being shuffledis found to share an intimate connection with the Mandelbrot set. Other card tricks link to the mathematical secrets of combinatorics, graph theory, number theory, topology, the Riemann hypothesis, and even Fermat's last theorem. Diaconis and Graham are mathematicians as well as skilled performers with decades of professional experience between them. In this book they share a wealth of conjuring lore, including some closely guarded secrets of legendary magicians. Magical Mathematics covers the mathematics of juggling and shows how the I Ching connects to the history of probability and magic tricks both old and new. It tells the storiesand reveals the best tricksof the eccentric and brilliant inventors of mathematical magic. Magical Mathematics exposes old gambling secrets through the mathematics of shuffling cards, explains the classic streetgambling scam of threecard monte, traces the history of mathematical magic back to the thirteenth century and the oldest mathematical trickand much more"
The mathematics of Paul Erdös(
Book
)
2 editions published in 2013 in English and held by 33 WorldCat member libraries worldwide
2 editions published in 2013 in English and held by 33 WorldCat member libraries worldwide
Handbook of combinatorial optimization by
Dingzhu Du(
Book
)
8 editions published in 2013 in English and held by 14 WorldCat member libraries worldwide
The second edition of this 7volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multivolumework deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communications networks, and management science. Aninternational team of 3040 experts in the field form the editorial board. The Handbook of Combinatorial Optimization, second edition is addressed to all scientists who use combinatorial optimization methods to model and solve problems. Experts in the field as well as nonspecialists will find the material stimulating and useful
8 editions published in 2013 in English and held by 14 WorldCat member libraries worldwide
The second edition of this 7volume handbook is intended to be a basic yet comprehensive reference work in combinatorial optimization that will benefit newcomers and researchers for years to come. This multivolumework deals with several algorithmic approaches for discrete problems as well as with many combinatorial problems. The editors have brought together almost every aspect of this enormous field of combinatorial optimization, an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communications networks, and management science. Aninternational team of 3040 experts in the field form the editorial board. The Handbook of Combinatorial Optimization, second edition is addressed to all scientists who use combinatorial optimization methods to model and solve problems. Experts in the field as well as nonspecialists will find the material stimulating and useful
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Patashnik, Oren
 Erdős, Paul 19131996 Interviewee Author
 Knuth, Donald Ervin 1938
 Nešetřil, Jaroslav Other Editor
 Spencer, Joel H. Author
 Rothschild, Bruce L. 1941
 Butler, Steve Editor
 Diaconis, Persi Author
 Grötschel, Martin Other Editor
 Lovász, László 1948 Other Editor
Useful Links
Associated Subjects
Algorithms Asymptotic expansions Biomedical engineering Canada Chemistry Combinatorial analysis Combinatorial number theory Combinatorial optimization Computational complexity Computer science Computer scienceMathematics Differentialalgebraic equationsNumerical solutions Differential equations Differential equationsNumerical solutions Engineering mathematics Erdős, Paul, Global analysis (Mathematics) Graham, Ronald L., Graph theory Hoffman, Paul, Hungary Information theory Magic tricks Mathematical optimization Mathematical physics Mathematicians Mathematics MathematicsPhilosophy Medical radiology Medicine MedicineMathematics NPcomplete problems Number theory Numerical analysis Operations research Ramsey theory Random graphs Scientists Steiner systems Stiff computation (Differential equations) United States
Alternative Names
Graham, R. 1935
Graham, R. L.
Graham, R. L. 1935
Graham, R. L. (Ronald L.), 1935
Graham, R. L. (Ronald Lewis), 1935
Graham, Ron.
Graham, Ron 1935
Graham, Ron L. 1935
Graham, Ronald.
Graham, Ronald 1935
Graham, Ronald L.
Graham, Ronald L. 1935...
Graham, Ronald Lewis 1935
Grèchem, R.
Grechem, R. 1935
Lewis Graham Ronald
Ron Graham Amerikaans wiskundige
Ronald Graham amerikansk matematikar
Ronald Graham amerikansk matematiker
Ronald Graham amerykański metematyk
Ronald Graham matemático estadounidense (n. 1935)
Ronald Graham matematico statunitense
Ronald Graham mathématicien américain
Ronald Graham USamerikanischer Mathematiker
Грэхем, Р 1935
Роналд Грејам
Рональд Грехем
Рональд Грэм американский математик
רונלד גראהם
رونالد گراهام ریاضیدان آمریکایی
로널드 그레이엄
グラハム, ロナルド
グレアム, ロナルド・L
ロナルド・グラハム
葛立恆
Languages
Covers