Carsten Lund (b. July 1, 1963) is a theoretical computer scientist working as a researcher at AT&T Labs.[1] Lund was a co-author on two of five competing papers at the 1990 Symposium on Foundations of Computer Science characterizing complexity classes such as PSPACE and NEXPTIME in terms of interactive proof systems;[2][3][4] this work became part of his 1991 Ph.D. thesis from the University of Chicago under the supervision of Lance Fortnow and László Babai,[5] for which he was a runner-up for the 1991 ACM Doctoral Dissertation Award.[6] He is also known for his joint work with Sanjeev Arora, Madhu Sudan, Rajeev Motwani, and Mario Szegedy that discovered the existence of probabilistically checkable proofs for NP-hard problems and used them to prove hardness results for approximation problems;[7][8] in 2001 he and his co-authors received the Gödel Prize for their share in these discoveries.[9] More recently he has published highly-cited work on internet traffic engineering.[10][11]
References
- ^ Lund's home page at AT&T.
- ^ Kolata, Gina (June 26, 1990), "In a Frenzy, Math Enters Age of Electronic Mail", New York Times, http://www.nytimes.com/1990/06/26/science/in-a-frenzy-math-enters-age-of-electronic-mail.html.
- ^ Lund, Carsten; Fortnow, Lance; Karloff, Howard J.; Nisan, Noam (1990), "Algebraic Methods for Interactive Proof Systems", Proc. 31st Annual Symposium on Foundations of Computer Science, pp. 2–10, doi:. Later published in JACM, 1991, DOI:10.1145/146585.146605.
- ^ Babai, László; Fortnow, Lance; Lund, Carsten (1990), "Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols", Proc. 31st Annual Symposium on Foundations of Computer Science, pp. 16–25, doi:. Later published in Computational Complexity, 1991, DOI:10.1007/BF01200056.
- ^ Cartsten Lund at the Mathematics Genealogy Project.
- ^ Koppes, Steve (May 11, 2000), "Ph.D. recipient receives top award in the field of computer science", University of Chicago Chronicle 19 (16), http://chronicle.uchicago.edu/000511/melkebeek.shtml.
- ^ Kolata, Gina (April 7, 1992), "New Short Cut Found For Long Math Proofs", New York Times, http://www.nytimes.com/1992/04/07/science/new-short-cut-found-for-long-math-proofs.html.
- ^ Arora, Sanjeev; Lund, Carsten; Motwani, Rajeev; Sudan, Madhu; Szegedy, Mario (1998), "Proof verification and the hardness of approximation problems", Journal of the ACM 45 (3): 501–555, doi:. Originally presented at the 1992 Symposium on Foundations of Computer Science, DOI:10.1109/SFCS.1992.267823.
- ^ Parberry, Ian (2001), 2001 Gödel Prize, ACM SIGACT, http://sigact.acm.org/prizes/godel/2001.html.
- ^ Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.; Rexford, J. (2000), "NetScope: traffic engineering for IP networks", IEEE Network 14 (2): 11–19, doi:.
- ^ Feldmann, A.; Greenberg, A.; Lund, C.; Reingold, N.; Rexford, J.; True, F. (2001), "Deriving traffic demands for operational IP networks: methodology and experience", IEEE/ACM Transactions on Networking 9 (3): 265–279, doi:.
|
|||||
This entry is from Wikipedia, the leading user-contributed encyclopedia. It may not have been reviewed by professional editors (see full disclaimer)
