Tripti Joshi (Editor)

Reid W Barton

Updated on
Edit
Like
Comment
Share on FacebookTweet on TwitterShare on LinkedInShare on Reddit
Nationality
  
American

Fields
  
Name
  
Reid Barton


Reid W. Barton httpschessprogrammingwikispacescomfileview

Born
  
May 6, 1983 (age 40) Arlington, Massachusetts (
1983-05-06
)

Notable awards
  
Morgan Prize (2004)4× IMO Gold Medallist2× IOI Gold Medallist4× Putnam Fellow

Education
  
Harvard University, Massachusetts Institute of Technology, Tufts University

Similar People
  
Gabriel Carroll, Daniel Kane, Melanie Wood, Arthur Rubin, Christian Reiher

Academic advisors
  
Alma mater
  
MITHarvard University

Academic advisor
  
Charles E. Leiserson

Reid W. Barton (born May 6, 1983) is one of the most successful performers in the International Science Olympiads.

Contents

Biography

Barton is the son of two environmental engineers. Officially homeschooled since third grade, 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. 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. After Akamai, Barton went to grad school at Harvard to pursue a Ph.D in Math.

Mathematical and programming competitions

Barton was the first student to win four gold medals at the International Mathematical Olympiad, culminating in full marks at the 2001 Olympiad held in Washington, D.C., shared with Gabriel Carroll, Xiao Liang and Zhang Zhiqiang.

Barton has been 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), a performance matched by seven others (Don Coppersmith (1968–71), Arthur Rubin (1970–73), Bjorn Poonen (1985–88), Ravi D. Vakil (1988–91), Gabriel D. Carroll (2000–03), Daniel Kane (2003–06), Brian R. Lawrence (2007–08, 2010–11)). Barton was a member of the MIT team which finished second in 2001 and first in 2003 and 2004.

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, the largest margin in IOI history at the time. 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).

Other accomplishments

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.

Barton has taught at various academic olympiad training programs for high schoolers, such as the Mathematical Olympiad Summer Program.

Selected publications

  • ——— (2004). "Packing densities of patterns" (PDF). Electronic Journal of Combinatorics. 11 (1): R80. .
  • ———; Burns, Keith (2000). "A simple special case of Sharkovskii's theorem". American Mathematical Monthly. 107 (10): 932–933. JSTOR 2695586. doi:10.2307/2695586. .
  • References

    Reid W. Barton Wikipedia