Mathematics People
Mathematics People Machinery (ACM-SIGACT). This award is presented an- Arora and Mitchell Awarded nually, with the presentation taking place alternately at Gödel Prize the International Colloquium on Automata, Languages, and Programming (ICALP) and the ACM Symposium on Sanjeev Arora of Princeton University and Joseph Theory of Computing (STOC). The prize is named in honor S. B. Mitchell of the State University of New York at of Kurt Gödel in recognition of his major contributions Stony Brook were named recipients of the Gödel Prize of to mathematical logic and of his interest, discovered in the Association for Computing Machinery (ACM) at the a letter he wrote to John von Neumann shortly before International Colloquium on Automata, Languages and von Neumann’s death, in what has become the famous “P Programming (ICALP 2010), held July 5–10 in Bordeaux, versus NP” question. France. The prize carries a cash award of US$5,000. Arora and Mitchell were honored for their concurrent —From an EATCS announcement discovery of a polynomial-time approximation scheme (PTAS) for the Euclidean Traveling Salesman Problem (ETSP). Mitchell was chosen for his 1999 paper, “Guillo- Mathematical Sciences Awards tine subdivisions approximate polygonal subdivisions: A simple polynomial-time approximation scheme for geo- at the 2010 ISEF metric TSP, k-MST, and related problems”, published in the The 2010 Intel International Science and Engineering Fair SIAM Journal of Computing 28(4), 1298–1309. Arora was (ISEF) was held in May 2010 in San Jose, California. Fifteen selected for his 1998 paper, “Polynomial-time approxima- hundred students in grades 9 through 12 from more tion schemes for Euclidean TSP and other geometric prob- than fifty countries participated in the fair.
[Show full text]