Yale Professor wins Godel Prize for showing how computer algorithms solve problems

Aug 13, 2008
Daniel Spielman Presenting Gödel Prize Lecture
Daniel Spielman presenting Gödel Prize lecture. Photo: Donna Marland

Daniel A. Spielman, professor of applied mathematics and computer science at Yale, has been awarded the prestigious Gödel Prize for developing a technique, known as Smoothed Analysis, that helps predict the success of problem-solving with real data and computers. He shared the prize with Shang-Hua Teng, professor of computer science at Boston University.

The award, carrying a $5,000 honorarium, recognizes outstanding papers in theoretical computer science. It was presented to Spielman and Teng by the Special Interest Group on Algorithms and Computing Theory (SIGACT) of the Association for Computing Machinery (ACM) and the European Association for Theoretical Computer Science (EATCS) at the International Colloquium on Automata, Languages, and Programming (ICALP) in Reykjavik, Iceland.

According to the association, this rigorous mathematical analysis provided a giant leap forward for predicting the performance of optimization tools for real data. Understanding the mathematical structure of these problems is necessary for the design of efficient protocols and software. The paper by Spielman and Teng, "Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time," was published in the Journal of the Association for Computing Machinery in 2004.

Spielman, a member of the Yale faculty since 2005, previously taught at Massachusetts Institute of Technology (MIT), after completing his postdoctoral work in mathematical sciences at the University of California Berkeley and his PhD at MIT. He graduated summa cum laude with exceptional distinction in computer science from Yale.

Spielman was previously honored with a National Science Foundation Career Award, and an Alfred P. Sloan Foundation Research Fellowship, and his work on Smoothed Analysis was cited by the National Science Foundation as one of three significant accomplishments funded by the computer science division of the NSF in 2003. He also received the celebrated 2002 Information Theory Society Paper Award given by the IEEE Information Theory Society.

Source: Yale University

Explore further: Addressing the human brain's big data challenge with BrainX3

add to favorites email to friend print save as pdf

Related Stories

Spacewalking astronauts finish extensive, trick cable job

11 hours ago

(AP)—Spacewalking astronauts successfully completed a three-day cable job outside the International Space Station on Sunday, routing several-hundred feet of power and data lines for new crew capsules commissioned ...

IOC defends Rio legacy amid green protests

13 hours ago

Ecological protests on Saturday dogged the final day of an International Olympic Committee executive board meeting in Rio as green campaigners slated the choice of a nature reserve to hold the golf event ...

Recommended for you

User comments : 1

Adjust slider to filter visible comments by rank

Display comments: newest first

superhuman
5 / 5 (1) Aug 13, 2008
I know what he will spend the money on - a laser pointer.

Please sign in to add a comment. Registration is free, and takes less than a minute. Read more

Click here to reset your password.
Sign in to get notified via email when new comments are made.