Carsten Lund

from Wikipedia, the free encyclopedia

Carsten Lund (born July 1, 1963 ) is an American computer scientist.

Lund received his PhD in 1991 from the University of Chicago with Lance Fortnow and László Babai ( The Power of Interaction ). He conducts research at the AT&T Laboratories in Florham Park (New Jersey), where, among other things, he deals with managing the flow of information in Internet networks (Internet Traffic Engineering).

Based on his doctoral thesis and in collaboration with his teachers Babai and Fortnow, he proved in the early 1990s theorems about the problems of complexity theory that can be proven by interactive proof systems (with PCPs) . This later led to the proof of the PCP theorem in the 1990s . In 2001 he received the Gödel Prize for his participation in this development.

In 2005 he won the ATT Science and Technology Medal.

Web links