Madhu Sudan

Madhu Sudan

Madhu Sudan ( _ta. மதுசூதன்) (born September 12, 1966) is an Indian computer scientist, professor of computer science at the Massachusetts Institute of Technology (MIT) and a member of MIT Computer Science and Artificial Intelligence Laboratory.

He was awarded the Rolf Nevanlinna Prize at the 24th International Congress of Mathematicians in 2002. The prize recognizes outstanding work in the mathematical aspects of computer science. Sudan was honored for his work in advancing the theory of probabilistically checkable proofs—a way to recast a mathematical proof in computer language for additional checks on its validity—and developing error-correcting codes. For the same work, he received the ACM's Distinguished Doctoral Dissertation Award in 1993 and the Gödel Prize in 2001.

Madhu Sudan has made important contributions to several areas of theoretical computer science, including probabilistically checkable proofs, non-approximability of optimization problems, and error-correcting codes. His work is characterized by brilliant insights and wide-ranging interests.

Madhu Sudan was born in Madras (Chennai), India. He received his bachelor's degree in computer science from IIT Delhi in 1987 and his doctoral degree in computer science at the University of California, Berkeley in 1992. He was a research staff member at the IBM Thomas J. Watson Research Center in Yorktown Heights, New York from 1992 to 1997.

External links

* [http://dblp.uni-trier.de/db/indices/a-tree/s/Sudan:Madhu.html DBLP: Madhu Sudan] .
* [http://people.csail.mit.edu/madhu Madhu Sudan's Home Page] .
* [http://www.hvk.org/articles/0902/151.html Mathematician at MIT: Indian wins ‘junior Nobel.’]


Wikimedia Foundation. 2010.

Нужна помощь с курсовой?

Look at other dictionaries:

  • Madhu Sudan — Naissance 12 septembre 1966 Chennai (Indie) Domicile États Unis Champs Informatique théorique Institution Microsoft Research, Massachusetts Institute of Technology Diplômé de …   Wikipédia en Français

  • Madhu Sudan — (* 2. September 1966 in Chennai) ist ein indischer Informatiker. Sudan studierte am Indian Institute of Technology in Delhi (Bachelor Abschluss 1987) und promovierte 1992 am Caltech bei Umesh Vazirani. Danach war er bis 1997 im Thomas J. Watson… …   Deutsch Wikipedia

  • Madhu — * Madhu means nectar in Sanskrit and liquor in Tamil. * Madhu is common female name but in the southern part of India it is a common gender neutral name. Lord Vishnu is also referred to by this name * In hindu mythology, Madhu is one of the demon …   Wikipedia

  • Sudan (disambiguation) — Sudan is a country in Northern Africa.Sudan may also refer to the following places:*Sudan (region), geographic region running across Africa (including the country of Sudan) just south of the Sahel *Sudan, Texas, United States *Dallas, Texas,… …   Wikipedia

  • PCP-Theorem — Das PCP Theorem ist ein Satz aus der theoretischen Informatik (Komplexitätstheorie). Es beruht auf dem Konzept des zufällig verifizierbaren Beweises eines mathematischen Satzes (probabilistic checkable proof, PCP), der wiederum auf das Konzept… …   Deutsch Wikipedia

  • Mekliganj (Vidhan Sabha constituency) — Mekliganj   Vidhan Sabha constituency   …   Wikipedia

  • Премия Неванлинны — (или приз Неванлинны, англ. Rolf Nevanlinna Prize) награда за выдающиеся достижения молодых математиков[1] в области информатики или вычислительной математики[2]. Присуждается раз в 4 года на Международном конгрессе математиков. Учреждена в… …   Википедия

  • List-decoding — In computer science, particularly in coding theory, list decoding is an alternative to unique decoding of error correcting codes for large error rates. The notion was proposed by Elias in the 1950 s. The main idea behind list decoding is that the …   Wikipedia

  • Venkatesan Guruswami — Infobox Scientist name = Venkatesan Guruswami caption = birth date = 1976 birth place = India residence = USA nationality = Indian field = Computer Science work institution = University of Washington alma mater = Indian Institute of Technology… …   Wikipedia

  • PCP theorem — In computational complexity theory, the PCP theorem states that every decision problem in the NP complexity class has probabilistically checkable proofs (proofs that can be checked by a randomized algorithm) of constant query complexity and… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”