Reid Barton
Revision as of 11:16, 30 April 2019 by GerdIsenberg (talk | contribs) (Created page with "'''Home * People * Reid Barton''' FILE:reidbarton.jpg|border|right|thumb|link=https://www.maa.org/node/119508| Reid Barton <ref>[https://www.maa.org/node...")
Reid Barton [1]
Reid W. Barton,
an American mathematician at Harvard University [2], and before as senior mathematics major at the Massachusetts Institute of Technology, receiving the 2004 Morgan Prize for his work on packing densities [3].
Reid Barton is one of the most successful performer of International Science Olympiads.
During his time at MIT, Reid Barton worked with Charles E. Leiserson and contributed to the CilkChess massive parallel computer chess program [4].
Selected Publications
- Reid Barton, Keith Burns (2000). A simple special case of Sharkovskii's theorem. American Mathematical Monthly, Vol. 107, No. 10 [7]
- Reid Barton (2004). Packing densities of patterns. Electronic Journal of Combinatorics, Vol. 11, No. 1, pdf
- Timothy G. Abbott, Reid Barton (2008). Generalizations of Kempe’s Universality Theorem. joined thesis, MIT, advisor Erik D. Demaine, pdf [8]
External Links
- Reid W. Barton from Wikipedia
- Harvard Mathematics Department : Reid Barton
- Reid Barton's ICGA Tournaments
- International Mathematical Olympiad - Reid Barton
References
- ↑ Citations | Mathematical Association of America
- ↑ Harvard Mathematics Department : Reid Barton
- ↑ Reid W. Barton Receives 2005 AMS Morgan Prize
- ↑ Reid Barton's ICGA Tournaments
- ↑ dblp: Reid W. Barton
- ↑ dblp: Reid Barton
- ↑ Sharkovskii's theorem from Wikipedia
- ↑ Kempe's universality theorem from Wikipedia
