Ronald Graham (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Ronald Graham" in English language version.

refsWebsite

Global rank English rank

18doi.org

2^nd place

18ams.org

451^st place

277^th place

5web.archive.org

1^st place

5semanticscholar.org

11^th place

8^th place

5zbmath.org

1,923^rd place

1,068^th place

3maa.org

3,479^th place

2,444^th place

3ucsd.edu

1,933^rd place

1,342^nd place

2jstor.org

26^th place

20^th place

2archive.org

6^th place

2arxiv.org

69^th place

59^th place

2harvard.edu

18^th place

17^th place

2siam.org

low place

6,473^rd place

1st-andrews.ac.uk

1,547^th place

1,410^th place

1cix.co.uk

low place

1juggle.org

low place

1calit2.net

low place

1mathgenealogy.org

4,501^st place

3,002^nd place

1nytimes.com

7^th place

1theguardian.com

12^th place

11^th place

1oakland.edu

low place

1simonsfoundation.org

low place

1popularmechanics.com

1,808^th place

1,159^th place

1nih.gov

4^th place

1emis.de

low place

1books.google.com

3^rd place

1combinatoricsinstitute.blogspot.com

low place

1nasonline.org

3,325^th place

2,396^th place

1acm.org

1,185^th place

840^th place

1inference-review.com

low place

acm.org

awards.acm.org

"Ronald L. Graham". ACM Fellows. Association for Computing Machinery. Retrieved July 12, 2020.

ams.org

mathscinet.ams.org

Peck, G. W. (2002). "Kleitman and combinatorics: a celebration". Discrete Mathematics. 257 (2–3): 193–224. doi:10.1016/S0012-365X(02)00595-2. MR 1935723. See in particular Section 4, "The mysterious G. W. Peck", pp. 216–219.
Croot, Ernest S. III (2003). "On a coloring conjecture about unit fractions". Annals of Mathematics. 157 (2): 545–556. arXiv:math.NT/0311421. Bibcode:2003math.....11421C. doi:10.4007/annals.2003.157.545. MR 1973054. S2CID 13514070.
Knuth, Donald E. (1990). "A Fibonacci-like sequence of composite numbers". Mathematics Magazine. 63 (1): 21–25. doi:10.2307/2691504. JSTOR 2691504. MR 1042933.
Shapira, Asaf (2008). "Quasi-randomness and the distribution of copies of a fixed graph". Combinatorica. 28 (6): 735–745. doi:10.1007/s00493-008-2375-0. MR 2488748. S2CID 3212684.
Pleanmani, Nopparat (2019). "Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph". Discrete Mathematics, Algorithms and Applications. 11 (6): 1950068, 7. doi:10.1142/s179383091950068x. MR 4044549. S2CID 204207428.
Albers, Susanne (2012). Grötschel, Martin (ed.). Ronald Graham: laying the foundations of online optimization. Documenta Mathematica. pp. 239–245. MR 2991486.
For a recent example, see e.g. Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry (2014). "Scheduling partially ordered jobs faster than $2^{n}$ ". Algorithmica. 68 (3): 692–714. arXiv:1108.0810. doi:10.1007/s00453-012-9694-7. MR 3160651.
Foster, Jim; Szabo, Tamas (2007). "Diameter graphs of polygons and the proof of a conjecture of Graham". Journal of Combinatorial Theory. Series A. 114 (8): 1515–1525. doi:10.1016/j.jcta.2007.02.006. MR 2360684..
Brass, Peter; Moser, William; Pach, János (2005). Research Problems in Discrete Geometry. New York: Springer. p. 45. ISBN 978-0387-23815-9. MR 2163782.
Hadjicostas, Petros; Monico, Chris (2015). "A new inequality related to the Diaconis-Graham inequalities and a new characterisation of the dihedral group". The Australasian Journal of Combinatorics. 63: 226–245. MR 3403376.
Hildebrand, Martin (2019). "On a lower bound for the Chung-Diaconis-Graham random process". Statistics & Probability Letters. 152: 121–125. doi:10.1016/j.spl.2019.04.020. MR 3953053. S2CID 164932860.
Proceedings of the Integers Conference 2005 in honor of Ron Graham's 70th birthday. Carrollton, GA: Integers. 2007. MR 2395797.
Review of Old and new problems and results in combinatorial number theory:
- Eggan, L. C. (1982). Mathematical Reviews. MR 0592420.{{cite journal}}: CS1 maint: untitled periodical (link)
- Reviews of Rudiments of Ramsey Theory:
  - Hindman, N. (1982). Mathematical Reviews. MR 0608630.{{cite journal}}: CS1 maint: untitled periodical (link)
  ams.org
  - "2003 Steele Prizes" (PDF). Notices of the American Mathematical Society. Vol. 50, no. 4. April 2003. pp. 462–467. Archived from the original (PDF) on February 6, 2011. Retrieved July 2, 2014.
  - "The Latest: Ronald Graham, 1935–2020". American Mathematical Society. July 7, 2020. Retrieved July 7, 2020.
  - "List of Fellows of the American Mathematical Society". American Mathematical Society. Retrieved July 9, 2020.
  - "Euler Book Prize" (PDF). MAA Prizes Awarded in San Diego. Notices of the American Mathematical Society. 60 (5): 613–614. May 2013.

archive.org

Hoffman, Paul (1998). The man who loved only numbers: the story of Paul Erdős and the search for mathematical truth. Hyperion. pp. 109–110. ISBN 978-0-7868-6362-4.
De Berg, Mark; Cheong, Otfried; Van Kreveld, Marc; Overmars, Mark (2008). Computational Geometry: Algorithms and Applications. Berlin: Springer. pp. 2–14. doi:10.1007/978-3-540-77974-2. ISBN 978-3-540-77973-5.

arxiv.org

Croot, Ernest S. III (2003). "On a coloring conjecture about unit fractions". Annals of Mathematics. 157 (2): 545–556. arXiv:math.NT/0311421. Bibcode:2003math.....11421C. doi:10.4007/annals.2003.157.545. MR 1973054. S2CID 13514070.
For a recent example, see e.g. Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry (2014). "Scheduling partially ordered jobs faster than $2^{n}$ ". Algorithmica. 68 (3): 692–714. arXiv:1108.0810. doi:10.1007/s00453-012-9694-7. MR 3160651.

books.google.com

Brass, Peter; Moser, William; Pach, János (2005). Research Problems in Discrete Geometry. New York: Springer. p. 45. ISBN 978-0387-23815-9. MR 2163782.

calit2.net

"Juggling Numbers: UC San Diego Professor Honored for Work in Applied Mathematics and Computational Science". California Institute for Telecommunications and Information Technology. May 4, 2009. Retrieved July 9, 2020.

cix.co.uk

Horgan, John (March 1997). "Profile: Ronald L. Graham – Juggling Act". Scientific American. 276 (3): 28–30. doi:10.1038/scientificamerican0397-28. Archived from the original on July 17, 2020. Retrieved July 8, 2020.

combinatoricsinstitute.blogspot.com

"Dr Ronald Graham awarded the 1993 Euler Medal of the ICA". Institute of Combinatorics and its Applications. October 3, 2019. Retrieved July 11, 2020.

doi.org

Horgan, John (March 1997). "Profile: Ronald L. Graham – Juggling Act". Scientific American. 276 (3): 28–30. doi:10.1038/scientificamerican0397-28. Archived from the original on July 17, 2020. Retrieved July 8, 2020.
Albers, Donald J. (November 1996). "A Nice Genius". Math Horizons. 4 (2): 18–23. doi:10.1080/10724117.1996.11974993. JSTOR 25678089.
Peck, G. W. (2002). "Kleitman and combinatorics: a celebration". Discrete Mathematics. 257 (2–3): 193–224. doi:10.1016/S0012-365X(02)00595-2. MR 1935723. See in particular Section 4, "The mysterious G. W. Peck", pp. 216–219.
Croot, Ernest S. III (2003). "On a coloring conjecture about unit fractions". Annals of Mathematics. 157 (2): 545–556. arXiv:math.NT/0311421. Bibcode:2003math.....11421C. doi:10.4007/annals.2003.157.545. MR 1973054. S2CID 13514070.
Knuth, Donald E. (1990). "A Fibonacci-like sequence of composite numbers". Mathematics Magazine. 63 (1): 21–25. doi:10.2307/2691504. JSTOR 2691504. MR 1042933.
Lamb, Evelyn (May 26, 2016). "Two-hundred-terabyte maths proof is largest ever". Nature. 534 (7605): 17–18. Bibcode:2016Natur.534...17L. doi:10.1038/nature.2016.19990. PMID 27251254.
Aigner, Martin; Ziegler, Günter M. (2018). Proofs from THE BOOK (6th ed.). Springer. pp. 79–80. doi:10.1007/978-3-662-57265-8. ISBN 978-3-662-57265-8.
Shapira, Asaf (2008). "Quasi-randomness and the distribution of copies of a fixed graph". Combinatorica. 28 (6): 735–745. doi:10.1007/s00493-008-2375-0. MR 2488748. S2CID 3212684.
Chung, Fan R. K. (1989). "Pebbling in hypercubes". SIAM Journal on Discrete Mathematics. 2 (4): 467–472. doi:10.1137/0402041.
Pleanmani, Nopparat (2019). "Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph". Discrete Mathematics, Algorithms and Applications. 11 (6): 1950068, 7. doi:10.1142/s179383091950068x. MR 4044549. S2CID 204207428.
Garey, M. R.; Johnson, D. S. (1981). "Approximation Algorithms for Bin Packing Problems: A Survey". In Ausiello, G.; Lucertini, M. (eds.). Analysis and Design of Algorithms in Combinatorial Optimization. Courses and Lectures of the International Centre for Mechanical Sciences. Vol. 266. Vienna: Springer. pp. 147–172. doi:10.1007/978-3-7091-2748-3_8. ISBN 978-3-211-81626-4.
Bastert, Oliver; Matuszewski, Christian (2001). "Layered drawings of digraphs". In Kaufmann, Michael; Wagner, Dorothea (eds.). Drawing Graphs: Methods and Models. Lecture Notes in Computer Science. Vol. 2025. Springer-Verlag. pp. 87–120. doi:10.1007/3-540-44969-8_5. ISBN 978-3-540-42062-0.
For a recent example, see e.g. Cygan, Marek; Pilipczuk, Marcin; Pilipczuk, Michał; Wojtaszczyk, Jakub Onufry (2014). "Scheduling partially ordered jobs faster than $2^{n}$ ". Algorithmica. 68 (3): 692–714. arXiv:1108.0810. doi:10.1007/s00453-012-9694-7. MR 3160651.
De Berg, Mark; Cheong, Otfried; Van Kreveld, Marc; Overmars, Mark (2008). Computational Geometry: Algorithms and Applications. Berlin: Springer. pp. 2–14. doi:10.1007/978-3-540-77974-2. ISBN 978-3-540-77973-5.
Foster, Jim; Szabo, Tamas (2007). "Diameter graphs of polygons and the proof of a conjecture of Graham". Journal of Combinatorial Theory. Series A. 114 (8): 1515–1525. doi:10.1016/j.jcta.2007.02.006. MR 2360684..
Hildebrand, Martin (2019). "On a lower bound for the Chung-Diaconis-Graham random process". Statistics & Probability Letters. 152: 121–125. doi:10.1016/j.spl.2019.04.020. MR 3953053. S2CID 164932860.
Butler, Steve; Cooper, Joshua; Hurlbert, Glenn, eds. (2018). Connections in discrete mathematics: a celebration of the work of Ron Graham. Cambridge University Press. ISBN 978-1-316-60788-6. Reviews: Hopkins, David (June 2019). The Mathematical Gazette. 103 (557): 374–375. doi:10.1017/mag.2019.82. S2CID 241732634.{{cite journal}}: CS1 maint: untitled periodical (link) Kleitman, Daniel (December 2019). "Only connect". Inferences. 5 (1).
Reviews of Handbook of Combinatorics:
- Wilf, Herbert S. (March 1997). The Mathematical Intelligencer. 19 (2): 68–69. doi:10.1007/bf03024438.{{cite journal}}: CS1 maint: untitled periodical (link)

emis.de

Albers, Susanne (2012). Grötschel, Martin (ed.). Ronald Graham: laying the foundations of online optimization. Documenta Mathematica. pp. 239–245. MR 2991486.

harvard.edu

ui.adsabs.harvard.edu

Croot, Ernest S. III (2003). "On a coloring conjecture about unit fractions". Annals of Mathematics. 157 (2): 545–556. arXiv:math.NT/0311421. Bibcode:2003math.....11421C. doi:10.4007/annals.2003.157.545. MR 1973054. S2CID 13514070.
Lamb, Evelyn (May 26, 2016). "Two-hundred-terabyte maths proof is largest ever". Nature. 534 (7605): 17–18. Bibcode:2016Natur.534...17L. doi:10.1038/nature.2016.19990. PMID 27251254.

inference-review.com

Butler, Steve; Cooper, Joshua; Hurlbert, Glenn, eds. (2018). Connections in discrete mathematics: a celebration of the work of Ron Graham. Cambridge University Press. ISBN 978-1-316-60788-6. Reviews: Hopkins, David (June 2019). The Mathematical Gazette. 103 (557): 374–375. doi:10.1017/mag.2019.82. S2CID 241732634.{{cite journal}}: CS1 maint: untitled periodical (link) Kleitman, Daniel (December 2019). "Only connect". Inferences. 5 (1).

jstor.org

Albers, Donald J. (November 1996). "A Nice Genius". Math Horizons. 4 (2): 18–23. doi:10.1080/10724117.1996.11974993. JSTOR 25678089.
Knuth, Donald E. (1990). "A Fibonacci-like sequence of composite numbers". Mathematics Magazine. 63 (1): 21–25. doi:10.2307/2691504. JSTOR 2691504. MR 1042933.

juggle.org

"Ron Graham Obituary". International Jugglers' Association. July 9, 2020. Retrieved July 13, 2020.

maa.org

"Ronald Lewis Graham, 2003–2004 MAA President". Mathematical Association of America. July 7, 2020. Archived from the original on July 7, 2020. Retrieved July 7, 2020.
"Allendoerfer Award". MAA Awards. Mathematical Association of America. Archived from the original on July 22, 2020. Retrieved July 9, 2020.
"Paul R. Halmos – Lester R. Ford Awards". MAA Awards. Mathematical Association of America. Archived from the original on June 26, 2017. Retrieved July 9, 2020.

mathgenealogy.org

Ronald Graham at the Mathematics Genealogy Project

nasonline.org

"Ronald Graham". Member directory. National Academy of Sciences. Retrieved July 11, 2020.

nih.gov

pubmed.ncbi.nlm.nih.gov

Lamb, Evelyn (May 26, 2016). "Two-hundred-terabyte maths proof is largest ever". Nature. 534 (7605): 17–18. Bibcode:2016Natur.534...17L. doi:10.1038/nature.2016.19990. PMID 27251254.

nytimes.com

Chang, Kenneth (July 23, 2020). "Ronald L. Graham, Who Unlocked the Magic of Numbers, Dies at 84". The New York Times. Retrieved January 28, 2021.

oakland.edu

"Erdos1: coauthors of Paul Erdős, together with their coauthors listed beneath them". Erdős Number Project. Retrieved July 12, 2020.

popularmechanics.com

Bennett, Jay (October 20, 2017). "The Enormity of the Number TREE(3) Is Beyond Comprehension". Popular Mechanics. Retrieved July 9, 2020.

semanticscholar.org

api.semanticscholar.org

Croot, Ernest S. III (2003). "On a coloring conjecture about unit fractions". Annals of Mathematics. 157 (2): 545–556. arXiv:math.NT/0311421. Bibcode:2003math.....11421C. doi:10.4007/annals.2003.157.545. MR 1973054. S2CID 13514070.
Shapira, Asaf (2008). "Quasi-randomness and the distribution of copies of a fixed graph". Combinatorica. 28 (6): 735–745. doi:10.1007/s00493-008-2375-0. MR 2488748. S2CID 3212684.
Pleanmani, Nopparat (2019). "Graham's pebbling conjecture holds for the product of a graph and a sufficiently large complete bipartite graph". Discrete Mathematics, Algorithms and Applications. 11 (6): 1950068, 7. doi:10.1142/s179383091950068x. MR 4044549. S2CID 204207428.
Hildebrand, Martin (2019). "On a lower bound for the Chung-Diaconis-Graham random process". Statistics & Probability Letters. 152: 121–125. doi:10.1016/j.spl.2019.04.020. MR 3953053. S2CID 164932860.
Butler, Steve; Cooper, Joshua; Hurlbert, Glenn, eds. (2018). Connections in discrete mathematics: a celebration of the work of Ron Graham. Cambridge University Press. ISBN 978-1-316-60788-6. Reviews: Hopkins, David (June 2019). The Mathematical Gazette. 103 (557): 374–375. doi:10.1017/mag.2019.82. S2CID 241732634.{{cite journal}}: CS1 maint: untitled periodical (link) Kleitman, Daniel (December 2019). "Only connect". Inferences. 5 (1).

siam.org

"George Pólya Prize in Applied Combinatorics". Society for Industrial and Applied Mathematics. Retrieved July 11, 2020.
"SIAM Fellows". Society for Industrial and Applied Mathematics. Retrieved July 11, 2020.

simonsfoundation.org

Roberts, Siobhan (December 10, 2015). "New Erdős Paper Solves Egyptian Fraction Problem". Simons Foundation.

st-andrews.ac.uk

mathshistory.st-andrews.ac.uk

O'Connor, John J.; Robertson, Edmund F. "Ronald Graham". MacTutor History of Mathematics Archive. University of St Andrews.

theguardian.com

Ron Graham obituary by Colm Mulcahy, The Guardian, August 3, 2020

ucsd.edu

math.ucsd.edu

Bigelow, Bruce V. (March 18, 2003). "You can count on him: Math expert coolly juggles scientific puzzles and six or seven balls" (PDF). The San Diego Union-Tribune.
Rabiner, Larry (February 4, 2000). "Ron Graham – A Biographical Retrospective" (PDF).
Guinness Book of World Records (Rev. American ed.). Sterling Publishing. 1980. p. 193. ISBN 0806901683.

web.archive.org

"2003 Steele Prizes" (PDF). Notices of the American Mathematical Society. Vol. 50, no. 4. April 2003. pp. 462–467. Archived from the original (PDF) on February 6, 2011. Retrieved July 2, 2014.
Horgan, John (March 1997). "Profile: Ronald L. Graham – Juggling Act". Scientific American. 276 (3): 28–30. doi:10.1038/scientificamerican0397-28. Archived from the original on July 17, 2020. Retrieved July 8, 2020.
"Ronald Lewis Graham, 2003–2004 MAA President". Mathematical Association of America. July 7, 2020. Archived from the original on July 7, 2020. Retrieved July 7, 2020.
"Allendoerfer Award". MAA Awards. Mathematical Association of America. Archived from the original on July 22, 2020. Retrieved July 9, 2020.
"Paul R. Halmos – Lester R. Ford Awards". MAA Awards. Mathematical Association of America. Archived from the original on June 26, 2017. Retrieved July 9, 2020.

zbmath.org

Reviews of Ramsey Theory:
- Li, Ko-Wei. zbMATH. Zbl 0455.05002.{{cite journal}}: CS1 maint: untitled periodical (link)
- Reviews of Concrete Mathematics:
  - Bressoud, David M. zbMATH. Zbl 0668.00003.{{cite journal}}: CS1 maint: untitled periodical (link)
  - Reviews of Erdős on Graphs:
    - Faudree, R. zbMATH. Zbl 0890.05049.{{cite journal}}: CS1 maint: untitled periodical (link)
    - Reviews of Magical Mathematics:
      - Rogovchenko, Yuri V. zbMATH. Zbl 1230.00009.{{cite journal}}: CS1 maint: untitled periodical (link)
      - Reviews of The Mathematics of Paul Erdős:
        Soifer, A. zbMATH. Zbl 0916.01022.{{cite journal}}: CS1 maint: untitled periodical (link)