Reid William Barton (born May 6, 1983) is a mathematician and also one of the most successful performers in the International Science Olympiads.[1][2]
Reid William Barton | |
|---|---|
| Born | May 6, 1983 |
| Nationality | American |
| Alma mater | |
| Awards |
|
| Scientific career | |
| Fields | Mathematics |
| Academic advisors | Charles E. Leiserson, Michael J. Hopkins |
Biography edit
Barton is the son of two environmental engineers.[1] Barton took part-time classes at Tufts University in chemistry (5th grade), physics (6th grade), and subsequently Swedish, Finnish, French, and Chinese. Since eighth grade he worked part-time with MIT computer scientist Charles E. Leiserson on CilkChess, a computer chess program.[1] Subsequently, he worked at Akamai Technologies with computer scientist Ramesh Sitaraman to build one of the earliest video performance measurement systems that have since become a standard in industry.[3] After Akamai, Barton went to grad school at Harvard to pursue a Ph.D. in mathematics, which he completed in 2019 under the supervision of Michael J. Hopkins.[4] Afterwards, he did research as a post-doctoral fellow at Pittsburgh.[5][6] As of November 2021 he sits on the committee for the "IMO Grand Challenge".
Mathematical and programming competitions edit
Barton was the first student to win four gold medals at the International Mathematical Olympiad,[1] culminating in full marks at the 2001 Olympiad held in Washington, D.C., shared with Gabriel Carroll, Xiao Liang and Zhang Zhiqiang.[7]
Barton is one of seven people to have placed among the five top ranked competitors (who are themselves not ranked against each other) in the William Lowell Putnam Competition four times (2001–2004).[8] Barton was a member of the MIT team which finished second in 2001 and first in 2003 and 2004.[8]
Barton has won two gold medals at the International Olympiad in Informatics. In 2001 he finished first with 580 points out of 600, 55 ahead of his nearest competitor,[9] the largest margin in IOI history at the time.[10] Barton was a member of the 2nd and 5th place MIT team at the ACM International Collegiate Programming Contest, and reached the finals in the Topcoder Open (2004), semi-finals (2003, 2006), the TopCoder Collegiate Challenge (2004), semi-finals (2006), TCCC Regional finals (2002), and TopCoder Invitational semi-finalist (2002).[11]
Other accomplishments edit
Barton has won the Morgan Prize awarded jointly by the American Mathematical Society and the Mathematical Association of America for his work on packing densities.[12]
Barton has taught at various academic Olympiad training programs for high school students, such as the Mathematical Olympiad Summer Program.[13]
Selected publications edit
- ——— (2004-11-12). "Packing densities of patterns" (PDF). Electronic Journal of Combinatorics. 11 (1): R80. doi:10.37236/1833.
- ———; Burns, Keith (2000). "A simple special case of Sharkovskii's theorem". American Mathematical Monthly. 107 (10): 932–933. doi:10.2307/2695586. JSTOR 2695586.
References edit
- ^ a b c d Mackenzie, Dana (2001). "IMO's Golden Boy Makes Perfection Look Easy". Science. 293 (5530): 597. doi:10.1126/science.293.5530.597. PMID 11474084. S2CID 8587484..
- ^ Olson, Steve (2004). Count Down. Houghton Mifflin. p. 117. ISBN 0-618-25141-3.
- ^ Ramesh Sitaraman and Reid W. Barton. "Method and apparatus for measuring stream availability, quality and performance, US Patent, Feb 2002".
- ^ "A Model 2-Category of Enriched Combinatorial Premodel Categories" (PDF).
- ^ "Reid Barton". Department of Mathematics, Univ of Pittsburgh. Retrieved 29 August 2022.
- ^ "Meet the community". Github. Retrieved 29 August 2022.
- ^ "Individual results in IMO 2001". IMO Official Website.
- ^ a b William Lowell Putnam Competition, Mathematical Association of America list of Putnam winners
- ^ "List of Medalists". IOI 2001 Official Website. Archived from the original on 2007-04-05.
- ^ USACO, IOI 2001 news, [1]
- ^ Coder achievements at TopCoder
- ^ 2004 Morgan Prize
- ^ Index of /rwbarton/Public/mop